Fixed Length Walk Queries

You are given an undirected graph with n nodes and m edges. The graph is simple and connected. You start at a specific node, and on each turn you must move through an edge to another node. Your task is to answer q queries of the form: "is it possible to start at node a and end up on node b after exactly x turns?" Input The first line contains three integers n, m and q: the number of nodes, edg