//~ while (clock()<=69*CLOCKS_PER_SEC)
//~ #pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
//~ #pragma GCC target ("avx2")
//~ #pragma GCC optimize("Ofast")
//~ #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//~ #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;

template <typename T>
using ordered_set =
    tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define sim template < class c
#define ris return * this
#define dor > debug & operator <<
#define eni(x) sim > typename \
  enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
    *this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

#define shandom_ruffle random_shuffle

using ll=long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using vi=vector<int>;
using vll=vector<ll>;
const int nax=1007;
const ll mod=1000*1000*1000+7;

ll inv(ll v)
{
	if (v<=1)
		return v;
	return inv(mod%v)*(mod-mod/v)%mod;
}

int n, m;

int d;
ll mac[nax][nax];
ll odw[nax][nax];

ll pam[nax][nax];

int zak[nax];

void zam(int a, int b)
{
	for (int i=1; i<=d; i++)
		swap(mac[a][i], mac[b][i]);
	for (int i=1; i<=d; i++)
		swap(odw[a][i], odw[b][i]);
}

void dod(int a, int b, ll w)
{
	for (int i=1; i<=d; i++)
		mac[a][i]=(mac[a][i]+mac[b][i]*w)%mod;
	for (int i=1; i<=d; i++)
		odw[a][i]=(odw[a][i]+odw[b][i]*w)%mod;
}

void mnoz(int a, ll w)
{
	for (int i=1; i<=d; i++)
		mac[a][i]=(mac[a][i]*w)%mod;
	for (int i=1; i<=d; i++)
		odw[a][i]=(odw[a][i]*w)%mod;
}

void gaussuj()
{
	for (int i=1; i<=d; i++)
		for (int j=1; j<=d; j++)
			odw[i][j]=(i==j);
	for (int i=1; i<=d; i++)
	{
		for (int j=i; j<=d; j++)
		{
			if (mac[j][i])
			{
				zam(i, j);
				break;
			}
		}
		assert(mac[i][i]);
		mnoz(i, inv(mac[i][i]));
		for (int j=1; j<=d; j++)
			if (j!=i)
				dod(j, i, mod-mac[j][i]);
	}
}

int cnt;

int fix(int v)
{
	return (v-1+cnt)%n+1;
}

int main()
{
	scanf("%d%d", &n, &m);
	for (int i=1; i<=n; i++)
		mac[i][i]=1;
	while(m--)
	{
		int a, b;
		scanf("%d%d", &a, &b);
		mac[a][b]=rand()%(mod-1)+1;
	}
	d=n;
	gaussuj();
	for (int i=1; i<=n; i++)
		for (int j=1; j<=n; j++)
			pam[i][j]=odw[i][j];
	int q;
	scanf("%d", &q);
	while(q--)
	{
		scanf("%d", &d);
		for (int i=1; i<=d; i++)
		{
			scanf("%d", &zak[i]);
			zak[i]=fix(zak[i]);
		}
		for (int i=1; i<=d; i++)
			for (int j=1; j<=d; j++)
				mac[i][j]=pam[zak[i]][zak[j]];
		gaussuj();
		int r;
		scanf("%d", &r);
		while(r--)
		{
			int a, b;
			scanf("%d%d", &a, &b);
			a=fix(a);
			b=fix(b);
			ll x=0;
			for (int i=1; i<=d; i++)
				for (int j=1; j<=d; j++)
					x=(x+pam[a][zak[i]]*odw[i][j]%mod*pam[zak[j]][b])%mod;
			int wyn=(x!=pam[a][b]);
			cnt+=wyn;
			printf("%d", wyn);
		}
		printf("\n");
	}
	return 0;
}