#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <cstdlib>

using namespace std;
const int maxn=200;
const int maxm=maxn*maxn;

bool g[maxn][maxn];
int n,m,l;

void init()
{
	scanf("%d%d%d",&n,&m,&l);
	int a,b;
	for (int i=1;i<=m;i++)
	{
		scanf("%d%d",&a,&b);
		g[a][b]=true;
	}
}

int f[2][maxn];

int solve(int S,int T)
{
	memset(f,0,sizeof(f));
	f[0][S]=1;
	for (int tim=1;tim<=l;tim++)
	{
		for (int i=1;i<=n;i++)
		if (f[0][i])
		for (int j=1;j<=n;j++)
		if (g[i][j])
		f[1][j]+=f[0][i];
		memcpy(f[0],f[1],sizeof(f[1]));
		memset(f[1],0,sizeof(f[1]));
	}
	return f[0][T];
}

int main()
{
	freopen("merchant.in","r",stdin);
	freopen("merchant.out","w",stdout);
	int q,a,b;
	init();
	scanf("%d",&q);
	for (int i=1;i<=q;i++)
	{
		scanf("%d%d",&a,&b);
		printf("%d\n",solve(a,b));
	}
	return 0;
}