#include "garden.h"
#include "gardenlib.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define lsb(x) (x&(-x))
#define pii pair<int,int>
#define ss second
#define ff first
#define piii pair<int,pii>
#define debu(x) (cerr << #x << " = "<< x << "\n")
#define debu2(x,y) (cerr << #x << " = "<< x << " " << #y << " = " << y << "\n")
#define debu3(x,y,z) (cerr << #x << " = "<< x << " " << #y << " = " << y << " " << #z << " = " << z<< "\n")
#define bitout(x,y) {\
cerr << #x << " : ";\
for (int justforbits = y; justforbits >=0; justforbits--)cout << (((1 << justforbits) & x)>=1);\
cout << "\n";\
}
#define rangeout(j,rangestart,rangeend) {\
cerr << "outputting " << #j<< ":\n";\
for (int forrang = rangestart; forrang <= rangeend; forrang++)cerr << j[forrang] << " ";\
cerr<<"\n";\
}
#define c1 {cerr << "Checkpoint 1! \n\n";cerr.flush();}
#define c2 {cerr << "Checkpoint 2! \n\n";cerr.flush();}
#define c3 {cerr << "Checkpoint 3! \n\n";cerr.flush();}
#define c4 {cerr << "Checkpoint 4! \n\n";cerr.flush();}
#define vi vector<int>
#define vpii vector<pii>
#define fr(i,x,y) for(int i=x;i<=y;i++)
typedef long long ll;
//for the sake of erasing /*
/*int dfs(int cn, vector<vi>& childlist, vector<int>&parent)
{
}*/
//forgot to minus n from your node number when doing for the second state nodes
//possible for smth to not be a cycle ugh
//bruh i forgot to assign cyc2 TT
//oh my gyatt please just actually run thru the steps in ur head and be more clear before coding gyatt dangit
#define lgn 31
bool vilavis=false;
int p,n;
void dfs(ll& cyc, int star, int cn, int cd, vector<vi>& childlist, vector<int>& depths)
{
//debu2(star,cn);
if(vilavis&&cn==star){cyc=cd;return;}
if(cn<n)depths[cd]++;
vilavis=true;
for(int to:childlist[cn])
{
dfs(cyc,star,to,cd+1,childlist,depths);
}
}
/*int decomp(int x, ll amt, vector<vi>& twok)
{
for(int i=lgn;i>=0;i--)
{
if((1ll<<i)&amt){x=twok[x][i];if(x==-1)return -1;}
}
return x;
}*/
//ALL NODES UNDER N EXIST!!!!! (DUH)
//FOR NODES ABOVE N: YOU ONLY EXIST IF YOU HAVE AT LEAST ONE CHILD THAT EXISTS
void count_routes(int N, int M, int P, int R[][2], int Q, int G[])
{
int t1,t2,t3,t4;
n=N;p=P;
vector<set<pii>>aj(n);
for(int i=0;i<M;i++)
{
int t1=R[i][0],t2=R[i][1];
aj[t1].insert(mp(i,t2));
aj[t2].insert(mp(i,t1));
}
vector<int>parent(2*n,-1);
vector<vi>childlist(2*n);
for(int i=0;i<n;i++)
{
t1=(*aj[i].begin()).ss;
if((*aj[t1].begin()).ss==i&&aj[t1].size()!=1){t1+=n;}
parent[i]=t1;
childlist[t1].pb(i);
}
for(int i=n;i<2*n;i++)
{
if(aj[i-n].size()==1)continue;
t1=(*next(aj[i-n].begin())).ss;
if((*aj[t1].begin()).ss==i-n&&aj[t1].size()!=1){t1+=n;}
parent[i]=t1;
childlist[t1].pb(i);
}
ll cyc1=LLONG_MAX,cyc2=LLONG_MAX;
vector<int>depths1(2*n,0),depths2(2*n,0);
dfs(cyc1,p,p,0,childlist,depths1);
vilavis=false;
dfs(cyc2,p+n,p+n,0,childlist,depths2);
sort(G,G+Q);
ll ca=0;
vector<int>dd1(2*n,0),dd2(2*n,0);
for(int i=0;i<Q;i++)
{
int q=G[i];
for(;ca<=min(q,2*n-1);ca++)
{
dd1[ca%cyc1]+=depths1[ca];
dd2[ca%cyc2]+=depths2[ca];
}
int ans=0;
if(q%cyc1<2*n)ans+=dd1[q%cyc1];
if(q%cyc2<2*n)ans+=dd2[q%cyc2];
answer(ans);
}
}
