#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)
{
}*/
#define lgn 32
int decomp(int x, ll amt, vector<vi>& twok)
{
for(int i=lgn;i>=0;i--)
{
if((1ll<<i)&amt){x=twok[x][i];}
}
return x;
}
void count_routes(int N, int M, int P, int R[][2], int Q, int G[])
{
int t1,t2,t3,t4;
int xx=G[0];
int 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&&aj[t1].size()!=1){t1+=n;}
parent[i]=t1;
childlist[t1].pb(i);
}
/*vector<bool>visited(2*n,false);
dfs(p,childlist,parent);dfs(p+n,childlist,parent);*/
vector<vector<int>>twok(2*n,vector<int>(33,-1));
fr(i,0,2*n-1){twok[i][0]=parent[i];}
for(int i=1;i<=lgn;i++)
{
for(int ii=0;ii<2*n;ii++)
{
t1=twok[ii][i-1];
if(t1==-1)continue;
twok[ii][i]=twok[t1][i-1];
}
}
int ans=0;
for(int i=0;i<n;i++)
{
if(decomp(i,xx,twok)%n==p){ans++;}
}
answer(ans);
}
