#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

namespace nqio{const unsigned R=4e5,W=4e5;char*a,*b,i[R],o[W],*c=o,*d=o+W,h[40],*p=h,y;bool s;struct q{void r(char&x){x=a==b&&(b=(a=i)+fread(i,1,R,stdin),a==b)?-1:*a++;}void f(){fwrite(o,1,c-o,stdout);c=o;}~q(){f();}void w(char x){*c=x;if(++c==d)f();}q&operator>>(char&x){do r(x);while(x<=32);return*this;}q&operator>>(char*x){do r(*x);while(*x<=32);while(*x>32)r(*++x);*x=0;return*this;}template<typename t>q&operator>>(t&x){for(r(y),s=0;!isdigit(y);r(y))s|=y==45;if(s)for(x=0;isdigit(y);r(y))x=x*10-(y^48);else for(x=0;isdigit(y);r(y))x=x*10+(y^48);return*this;}q&operator<<(char x){w(x);return*this;}q&operator<<(char*x){while(*x)w(*x++);return*this;}q&operator<<(const char*x){while(*x)w(*x++);return*this;}template<typename t>q&operator<<(t x){if(!x)w(48);else if(x<0)for(w(45);x;x/=10)*p++=48|-(x%10);else for(;x;x/=10)*p++=48|x%10;while(p!=h)w(*--p);return*this;}}qio;}using nqio::qio;

const int maxn = 505, mod = 998244353;

int qpow(int x, int y = mod - 2) {
	int res = 1;
	for (; y; y >>= 1, x = (ll)x * x % mod) {
		if (y & 1) res = (ll)res * x % mod;
	}
	return res;
}

void inv(int a[maxn][maxn], int n, int b[maxn][maxn]) {
	for (int i = 1; i <= n; i++) {
		memset(b[i] + 1, 0, sizeof(int) * n);
		b[i][i] = 1;
	}
	for (int i = 1; i <= n; i++) {
		int p = i;
		for (int j = i; j <= n; j++) {
			if (a[j][i]) { p = j; break; }
		}
		if (p != i) {
			for (int j = i; j <= n; j++) swap(a[i][j], a[p][j]);
			for (int j = 1; j <= n; j++) swap(b[i][j], b[p][j]);
		}
		int num = qpow(a[i][i]);
		for (int j = i; j <= n; j++) a[i][j] = (ll)a[i][j] * num % mod;
		for (int j = 1; j <= n; j++) b[i][j] = (ll)b[i][j] * num % mod;
		for (int j = 1; j <= n; j++) if (j != i) {
			int v = mod - a[j][i];
			for (int k = i; k <= n; k++) a[j][k] = (a[j][k] + (ll)a[i][k] * v) % mod;
			for (int k = 1; k <= n; k++) b[j][k] = (b[j][k] + (ll)b[i][k] * v) % mod;
		}
	}
}

mt19937 rng(time(0));

int get(int l = 2, int r = mod - 2) {
	return rng() % (r - l + 1) + l;
}

int n, m, q, cnt;
int N[maxn][maxn], M[maxn][maxn], P[maxn][maxn], iP[maxn][maxn];

int main() {
	qio >> n >> m;
	while (m--) {
		int u, v;
		qio >> u >> v;
		N[u][v] = mod - get();
	}
	for (int i = 1; i <= n; i++) {
		N[i][i] = mod + 1 - get();
	}
	inv(N, n, M);
	qio >> q;
	while (q--) {
		int k, len, ps[10];
		qio >> k;
		for (int i = 1; i <= k; i++) {
			qio >> ps[i];
			ps[i] = (ps[i] + cnt - 1) % n + 1;
		}
		for (int i = 1; i <= k; i++) {
			for (int j = 1; j <= k; j++) {
				P[i][j] = M[ps[i]][ps[j]];
			}
		}
		inv(P, k, iP);
		qio >> len;
		while (len--) {
			int s, t, ans = 0;
			qio >> s >> t;
			s = (s + cnt - 1) % n + 1, t = (t + cnt - 1) % n + 1;
			for (int i = 1; i <= k; i++) {
				for (int j = 1; j <= k; j++) {
					ans = (ans + (ll)M[s][ps[i]] * iP[i][j] % mod * M[ps[j]][t]) % mod;
				}
			}
			if (ans == M[s][t]) qio << '0';
			else qio << '1', ++cnt;
		}
		qio << '\n';
	}
	return 0;
}