/*
бинарный подъем
*/
#include "garden.h"
#include "gardenlib.h"
#include <bits/stdc++.h>
//#include "grader.cpp"
#define pii pair<int, int>
#define fr first
#define sc second
#define pb push_back
#define mk make_pair
#define szof(s) (int)s.size()
using namespace std;
const int MAXN = 150005;
int n, m, p;
vector <pii> edges;
vector <pii> g[MAXN]; //id, vertex
int mn[MAXN], mx[MAXN];
pii table[2][MAXN][30];
int get(int v, int len) {
int ind = -1;
int cur = v;
pii need;
bool start = 1;
for (int i = 30; i >= 0; i--) {
if (len & (1 << i)) {
if (start) {
need = table[0][cur][i];
cur = need.second;
ind = need.first;
start = 0;
} else {
if (ind != g[cur][0].first) {
need = table[0][cur][i];
cur = need.second;
ind = need.first;
} else {
need = table[1][cur][i];
cur = need.second;
ind = need.first;
}
}
}
}
return cur;
}
int solve(int k) {
int ans = 0;
for (int v = 0; v < n; v++) {
if (get(v, k) == p) {
ans++;
}
}
return ans;
}
void count_routes(int N, int M, int P, int R[][2], int Q, int G[]) {
n = N;
m = M;
p = P;
for (int i = 0; i < M; i++) {
int x = R[i][0];
int y = R[i][1];
edges.pb({x, y});
if (szof(g[x]) < 2) {
g[x].push_back({i, y});
}
if (szof(g[y]) < 2) {
g[y].push_back({i, x});
}
}
for (int i = 0; i < n; i++) {
if (szof(g[i]) < 2) {
g[i].pb(g[i][0]);
}
}
for (int v = 0; v < n; v++) {
table[0][v][0] = g[v][0];
table[1][v][0] = g[v][1];
}
for (int pw = 1; pw < 30; pw++) {
for (int v = 0; v < n; v++) {
for (int tp = 0; tp <= 1; tp++) {
int to = table[tp][v][pw - 1].second;
int ind = table[tp][v][pw - 1].first;
if (ind != g[to][0].first) {
table[tp][v][pw] = table[0][to][pw - 1];
} else {
table[tp][v][pw] = table[1][to][pw - 1];
}
}
}
}
for (int i = 0; i < Q; i++) {
answer(solve(G[i]));
}
}
