hdu2157

//¹Ø¼üÔÚÀëɢ֪ʶ£¬M^k 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=24;
ll mod=1000;
ll n,m,t,k,x,y,a[maxn];
typedef struct jz{
    ll m[maxn][maxn];
}jz; 
jz mul(jz a,jz b){
    jz c;     
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++){
        	c.m[i][j]=0;
        	for(int k=1;k<=n;k++)
                c.m[i][j]=(c.m[i][j]+a.m[i][k]*b.m[k][j]%mod)%mod;
		}
    return c;
}
jz ksm(jz a,ll b){
	jz ans;
    for(int i=1;i<=n;i++)
    	for(int j=1;j<=n;j++)
    		ans.m[i][j]=1*(i==j);
    while(b){
    	if(b%2) ans=mul(ans,a);
        a=mul(a,a);
        b/=2;
    }    
    return ans;
}
int main(){
	jz A,B;
    while(~scanf("%lld%lld",&n,&m)){
    	if(n==0&&m==0) break;
    	memset(A.m,0,sizeof(A.m));
		while(m--){
			scanf("%lld%lld",&x,&y);
			A.m[x+1][y+1]=1;
		}	
		cin>>t;
		while(t--){
			scanf("%lld%lld%lld",&x,&y,&k);
			jz B=ksm(A,k); 	
			printf("%lld\n",B.m[x+1][y+1]);
		}	
    }
    return 0;
}