// what is matter? never mind. 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2") 
#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 ll long long
#define ull unsigned 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 mod 998244353
struct modint{
	int x;
	modint(int o=0){x=o;}
	modint &operator = (int o){return x=o,*this;}
	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint &operator -=(modint o){return x=x-o.x<0?x-o.x+mod:x-o.x,*this;}
	modint &operator *=(modint o){return x=1ll*x*o.x%mod,*this;}
	modint &operator ^=(int b){
		modint a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint &operator /=(modint o){return *this *=o^=mod-2;}
	friend modint operator +(modint a,modint b){return a+=b;}
	friend modint operator -(modint a,modint b){return a-=b;}
	friend modint operator *(modint a,modint b){return a*=b;}
	friend modint operator /(modint a,modint b){return a/=b;}
	friend modint operator ^(modint a,int b){return a^=b;}
	friend bool operator ==(modint a,int b){return a.x==b;}
	friend bool operator !=(modint a,int b){return a.x!=b;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
	bool operator <(const modint&b)const{return x<b.x;}
};
inline modint qpow(modint x,int y){return x^y;}

vector<modint> fac,ifac,iv;
inline void initC(int n)
{
	if(iv.empty())fac=ifac=iv=vector<modint>(2,1);
	int m=iv.size(); ++n;
	if(m>=n)return;
	iv.resize(n),fac.resize(n),ifac.resize(n);
	For(i,m,n-1){
		iv[i]=iv[mod%i]*(mod-mod/i);
		fac[i]=fac[i-1]*i,ifac[i]=ifac[i-1]*iv[i];
	}
}
inline modint C(int n,int m){
	if(m<0||n<m)return 0;
	return initC(n),fac[n]*ifac[m]*ifac[n-m];
}
inline modint sign(int n){return (n&1)?(mod-1):(1);}

#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 400005
#define inf 0x3f3f3f3f

#define N 505

/*
https://_rqy.blog.uoj.ac/blog/8048
*/
int n,m;

struct mat{
	modint a[N][N];
	modint*operator [](int x){return a[x];}
	void print(int n){
		For(i,1,n)For(j,1,n)cout<<a[i][j].x<<" \n"[j==n];
		puts("-----");
	}
};

bool inv(mat&a,int n){
	static int pi[N],pj[N];
	For(k,1,n){
		pi[k]=pj[k]=0;
		For(i,k,n)For(j,k,n)if(a[i][j].x){pi[k]=i,pj[k]=j;break;}
		if(!pi[k])return 0;
		For(i,1,n)swap(a[k][i],a[pi[k]][i]);
		For(i,1,n)swap(a[i][k],a[i][pj[k]]);
		if(!a[k][k].x)return 0;
		a[k][k]=1/a[k][k];
		For(j,1,n)if(j!=k)a[k][j]*=a[k][k];
		For(i,1,n)if(i!=k)For(j,1,n)if(j!=k)a[i][j]-=a[i][k]*a[k][j];
		For(i,1,n)if(i!=k)a[i][k]=-a[i][k]*a[k][k];
	}
	Rep(k,n,1){
		For(i,1,n)swap(a[pj[k]][i],a[k][i]);
		For(i,1,n)swap(a[i][pi[k]],a[i][k]);
	}
	return 1;
}

mat g,ig,a;
mt19937_64 rnd(time(0));
int R(int l,int r){
	return rnd()%(r-l+1)+l;
}

int pos[10];

signed main()
{
	n=read(),m=read();
	For(i,1,m){
		int u=read(),v=read();
		g[u][v]=R(1,mod-1);
	}
	For(u,1,n) g[u][u]=R(0,mod-1);
	ig=g;
	assert(inv(ig,n));
	int Q=read(),cnt=0;
	For(_,1,Q){
		int k=read();
		For(i,1,k)pos[i]=(read()+cnt-1)%n+1;
		For(i,1,k)
			For(j,1,k)
				a[i][j]=ig[pos[i]][pos[j]];
		inv(a,k);
		int q2=read();
		while(q2--){
			int s=(read()+cnt-1)%n+1,t=(read()+cnt-1)%n+1;
			modint res=0;
			For(i,1,k)
				For(j,1,k)
					res+=ig[s][pos[i]]*a[i][j]*ig[pos[j]][t];
			if(res.x==ig[s][t].x) putchar('0');
			else putchar('1'),++cnt;
		}
		puts("");
	}
	return 0;
}
/*

*/