#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++)
#define defN 1000
vector<set<pii>>adjlist(defN);
int dfs(int cn, int amt, int fr)
{
if(amt==0)return cn;
if(fr==(*adjlist[cn].begin()).ss&&adjlist[cn].size()>1)
{
return dfs((*next(adjlist[cn].begin())).ss,amt-1,cn);
}
else
{
return dfs((*adjlist[cn].begin()).ss,amt-1,cn);
}
}
void count_routes(int N, int M, int P, int R[][2], int Q, int G[])
{
int xx=G[0];
for(int i=0;i<M;i++)
{
int t1=R[i][0],t2=R[i][1];
adjlist[t1].insert(mp(i,t2));
adjlist[t2].insert(mp(i,t1));
}
int ans=0;
for(int i=0;i<N;i++)
{
ans+=(dfs(i,xx,-1)==P);
}
answer(ans);
}
