#include<bits/stdc++.h> 
using namespace std;
queue<pair<long long,long long> >q;
long long n,m,M,x,y,z,ds[105][60],p,tp;
vector<long long>v[105];
int main(){
    freopen("messenger.in","r",stdin);
    freopen("messenger.out","w",stdout);
    ios::sync_with_stdio(false);
    cin>>n>>m>>M;
    for(long long i=1;i<=m;i++) cin>>x>>y,v[x].push_back(y);
    cin>>m;
    while(m--){
        cin>>x>>y>>z;
        for(long long i=1;i<=n;i++) for(long long j=0;j<=z+2;j++) ds[i][j]=0;
        ds[x][0]=1;
        for(long long i=0;i<=z;i++){
            for(long long j=1;j<=n;j++){
                if(!ds[j][i]) continue;
                for(long long k=0;k<v[j].size();k++){
                    ds[v[j][k]][i+1]+=ds[j][i],ds[v[j][k]][i+1]%=M;
                }
            }
        }
        cout<<ds[y][z]%M<<"\n";
    }
    return 0;
}