#include <bits/stdc++.h>
#define GET_MACRO(a, b, c, NAME, ...) NAME
#define rep(...) GET_MACRO(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define rep2(i, a) rep3 (i, 0, a)
#define rep3(i, a, b) for (int i = (a); i < (b); i++)
#define repr(...) GET_MACRO(__VA_ARGS__, repr3, repr2)(__VA_ARGS__)
#define repr2(i, a) repr3 (i, 0, a)
#define repr3(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define chmin(a, b) ((b) < a && (a = (b), true))
#define chmax(a, b) (a < (b) && (a = (b), true))
using namespace std;
typedef long long ll;

template<class T>
ostream &operator <<(ostream &os, const vector<T> &v) {
	rep (i, v.size()) {
		if (i) os << " ";
		os << v[i];
	}
	return os;
}

ll modulo(ll a, ll mod) {
	a %= mod; a += mod; a %= mod;
	return a;
}

ll modpow(ll a, ll b, ll mod) {
	ll res = 1;
	while (b) {
		if (b & 1) (res *= a) %= mod;
		(a *= a) %= mod;
		b /= 2;
	}
	return res;
}

ll modinv(ll a, ll mod) {
	return modpow(a, mod - 2, mod);
}

ll garner(vector<pair<ll, ll>> eq, ll mod) {
	eq.emplace_back(0, mod);
	int n = eq.size();
	vector<ll> coef(n, 1), sum(n, 0);
	rep (i, n - 1) {
		ll v = (eq[i].first - sum[i]) * modinv(coef[i], eq[i].second) % eq[i].second;
		if (v < 0) v += eq[i].second;
		rep (j, i + 1, n) {
			(sum[j] += coef[j] * v) %= eq[j].second;
			(coef[j] *= eq[i].second) %= eq[j].second;
		}
	}
	return sum.back();
}

int main() {
	int N, K;
	cin >> N >> K;
	vector<int> s(N);
	rep (i, N) s[i] = i;
	rep (i, K) {
		int X, Y;
		cin >> X >> Y;
		X--; Y--;
		swap(s[X], s[Y]);
	}

	vector<int> id(N, -1), index(N, -1);
	vector<vector<int>> orbit(N);
	rep (i, N) if (id[i] == -1) {
		int curr = i;
		int j = 0;
		while (id[curr] == -1) {
			id[curr] = i;
			index[curr] = j;
			orbit[i].push_back(curr);
			curr = s[curr];
			j++;
		}
	}

	int Q;
	cin >> Q;
	rep (i_, Q) {
		vector<int> A(N);
		rep (i, N) {
			cin >> A[i];
			A[i]--;
		}
		bool bad = false;
		vector<int> dist(N, -1);
		rep (i, N) {
			if (id[i] != id[A[i]]) bad = true;
			else {
				int d = modulo(index[A[i]] - index[i], orbit[id[i]].size());
				if (dist[id[i]] == -1) {
					dist[id[i]] = modulo(d, orbit[id[i]].size());
				} else {
					if (dist[id[i]] != d) bad = true;
				}
			}
		}
		if (bad) {
			cout << -1 << endl;
			continue;
		}

		vector<pair<ll, ll>> eq;
		ll prod = 1;
		rep (i, N) if (dist[i] != -1) {
			eq.emplace_back(dist[i], orbit[id[i]].size());
			prod *= orbit[id[i]].size();
		}
		const ll mod = 1e18;
		ll ans = garner(eq, mod);
		if (ans == 0) ans += prod;
		cout << ans << endl;
	}
	return 0;
}