#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
//#define int long long
using namespace std;
inline int read()
{
    char c=getchar();int x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 500005
#define inf 0x3f3f3f3f

int n,m,Q,mod,d[maxn];
vi rg[maxn],e[maxn],g[maxn];
int val[maxn];

int tot,col[maxn],cv[maxn],ce[maxn];
void dfs1(int u,int c){
	col[u]=c;
	++cv[c],ce[c]+=d[u],d[u]=0;
	for(int v:e[u]) if(d[v]) dfs1(v,c);
}

int col2[maxn],top[maxn];
int dfn[maxn],out[maxn],idx;
void dfs2(int u,int tp,int c){
	col2[u]=c;
	top[u]=tp;
	dfn[u]=++idx;
	for(int v:rg[u]) dfs2(v,tp,c);
	out[u]=idx;
}

bool chkg(int u,int v){
	auto it=lower_bound(g[u].begin(),g[u].end(),v);
	return it!=g[u].end() && (*it)==v;
}

signed main()
{
//	freopen("sheriruth.in","r",stdin); 
//	freopen("sheriruth.out","w",stdout);
	n=read(),m=read(),Q=read(),mod=read();
	For(i,1,n)val[i]=(1ll*val[i-1]*(i-1)+1)%mod;
	For(i,1,m){
		int u=read()+1,v=read()+1;
		e[u].pb(v),e[v].pb(u);
		g[u].pb(v),rg[v].pb(u);
		++d[v];
	}
	For(i,1,n)sort(g[i].begin(),g[i].end());
	queue<int>q;
	For(i,1,n)if(!d[i])q.push(i);
	while(q.size()){
		int u=q.front();q.pop();
		if(g[u].size()==0)continue;
		for(int x:g[u]) e[x].pb(g[u][0]),e[g[u][0]].pb(x);
		if(g[u].size()==1){
			int v=g[u][0];
			--d[v];
			if(!d[v])q.push(v);
		}
	}
	For(i,1,n)
		if(d[i]){
			++tot;
			dfs1(i,tot);
		}
	For(i,1,n)
		if(!col[i]){
			if(!g[i].size()) dfs2(i,0,0);
			else {
				int tmp=0;
				for(int v:g[i]) tmp|=col[v];
				if(tmp) dfs2(i,i,tmp); 
			}
		}
	For(_,1,Q){
		int u=read()+1,v=read()+1,res=0;
		if(!col[u]){
			if(!col[v]){
				res=(dfn[v]<=dfn[u]	&& dfn[u]<=out[v]);
			}else{
				int id=col[v];
				if(col2[u]!=id)res=0;
				else if(cv[id]==ce[id])res=g[top[u]].size();
				else{
					bool hav=chkg(top[u],v);
					res=g[top[u]].size()-hav;
					res=1ll*res*val[cv[id]-1]%mod;
					res=res+hav;
					res%=mod;
				}
			}
		}else{
			if(col[u]!=col[v]){
				res=0;
			}else{
				int id=col[u];
				if(u==v||cv[id]==ce[id])res=1;
				else res=val[cv[id]-1];
			}
		}
		res%=mod;
		printf("%d\n",res);
	}
	return 0;
}