#include <algorithm>
#include <iostream>
#include <cstring>
#include <random>
#include <chrono>
constexpr int N(510), p(1e9 + 9);
int fp(int a, int b)
{
	int ans(1), off(a);
	while (b)
	{
		if (b & 1)
			ans = 1ll * ans * off % p;
		off = 1ll * off * off % p;
		b >>= 1;
	}
	return ans;
}
void inv(int dat[N][N], int n, int ans[N][N])
{
	for (int i(1); i <= n; ++i)
	{
		std::memset(ans[i] + 1, 0, sizeof(int) * n);
		ans[i][i] = 1;
	}
	for (int i(1); i <= n; ++i)
	{
		int pos(i);
		for (int j(i); j <= n; ++j)
			if (dat[j][i])
			{
				pos = j;
				break;
			}
		if (pos != i)
		{
			for (int t(i); t <= n; ++t)
				std::swap(dat[i][t], dat[pos][t]);
			for (int t(1); t <= n; ++t)
				std::swap(ans[i][t], ans[pos][t]);
		}
		int num(fp(dat[i][i], p - 2));
		for (int t(i); t <= n; ++t)
			dat[i][t] = 1ll * dat[i][t] * num % p;
		for (int t(1); t <= n; ++t)
			ans[i][t] = 1ll * ans[i][t] * num % p;
		for (int j(1); j <= n; ++j)
			if (j != i)
			{
				int v(p - dat[j][i]);
				for (int t(i); t <= n; ++t)
					dat[j][t] = (dat[j][t] + 1ll * dat[i][t] * v) % p;
				for (int t(1); t <= n; ++t)
					ans[j][t] = (ans[j][t] + 1ll * ans[i][t] * v) % p;
			}
	}
}
namespace fr
{
#include <ctype.h>
	char buf[1 << 23], *p1 = buf, *p2 = buf, obuf[1 << 23], *O = obuf;
#define getchar() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 21, stdin), p1 == p2) ? EOF : *p1++)
#define putchar(c) (((O == obuf + (1 << 23)) ? (fwrite(obuf, 1, O - obuf, stdout), O = obuf) : O), *O++ = (c))
	void rd(char *x)
	{
		char c = getchar();
		while (isspace(c))
			c = getchar();
		while (!isspace(c) && c != EOF)
			*(x++) = c, c = getchar();
		*(x++) = '\0';
	}
	template <class T>
	void rd(T &x)
	{
		T ret = 0;
		bool flg = false;
		char c = getchar();
		while (!isdigit(c) && c != '-')
			c = getchar();
		if (c == '-')
			c = getchar(), flg = true;
		while (isdigit(c))
			ret = (ret << 1) + (ret << 3) + (c - '0'), c = getchar();
		if (flg)
			x = -ret;
		else
			x = ret;
	}
	void pc(char c) { putchar(c); }
	void flush() { fwrite(obuf, 1, O - obuf, stdout), O = obuf; }
	template <class T>
	void wr(T x)
	{
		if (x < 0)
			putchar('-'), x = -x;
		if (x == 0)
			putchar('0');
		static int cnt, stk[110];
		cnt = 0;
		while (x)
			stk[++cnt] = x % 10, x /= 10;
		for (int i = cnt; i; --i)
			putchar(stk[i] + '0');
	}
}
using fr::flush;
using fr::pc;
using fr::rd;
using fr::wr;
int main()
{
	static int tmp[N][N], trans[N][N], M[N][N], rev[N][N];
	std::mt19937 rnd(std::chrono::high_resolution_clock::now().time_since_epoch().count());
	std::uniform_int_distribution<int> uid{2, p - 2};
	int n, m;
	rd(n);
	rd(m);
	for (int i(1); i <= m; ++i)
	{
		int u, v;
		rd(u);
		rd(v);
		trans[u][v] = uid(rnd);
		tmp[u][v] = p - trans[u][v];
	}
	for (int i(1); i <= n; ++i)
		trans[i][i] = uid(rnd), tmp[i][i] = p + 1 - trans[i][i];
	inv(tmp, n, M);
	int q;
	rd(q);
	int cnt(0);
	while (q--)
	{
		int k;
		rd(k);
		static int ps[10];
		for (int i(1); i <= k; ++i)
		{
			int t;
			rd(t);
			ps[i] = (t + cnt - 1) % n + 1;
		}
		for (int i(1); i <= k; ++i)
		{
			for (int j(1); j <= k; ++j)
			{
				tmp[i][j] = M[ps[i]][ps[j]];
			}
		}
		inv(tmp, k, rev);
		int qq;
		rd(qq);
		while (qq--)
		{
			int s, t;
			rd(s);
			rd(t);
			s = (s + cnt - 1) % n + 1, t = (t + cnt - 1) % n + 1;
			int ans(0);
			for (int i(1); i <= k; ++i)
			{
				for (int j(1); j <= k; ++j)
				{
					ans = (ans + 1ll * M[s][ps[i]] * rev[i][j] % p * M[ps[j]][t]) % p;
				}
			}
			if (ans == M[s][t])
			{
				pc('0');
			}
			else
			{
				pc('1');
				++cnt;
			}
		}
		pc('\n');
	}
	flush();
	return 0;
}