#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
ll gcd(ll a, ll b){
	if(b==0) return a;
	return gcd(b, a%b);
}
ll lcm(ll a, ll b){
	return a/gcd(a, b)*b;
}
int n, k;
int p[110];
vector<vector<int>> v;
ll solve(vector<int> a){
	int r[110];
	for(int i=0; i<n; i++){
		int x=i;
		r[i]=-1;
		for(int j=0; j<n; j++){
			if(x==a[i]){
				r[i]=j; break;
			}
			x=p[x];
		}
		if(r[i]==-1) return -1;
	}
	ll ans=0;
	ll m=1;
	for(auto w:v){
		int m1=w.size();
		int r1=r[w[0]];
		for(int j=1; j<m1; j++){
			if(r1!=r[w[j]]) return -1;
		}
		bool ok=0;
		for(int j=0; j<m1; j++){
			if((ans+m*j)%m1==r1){
				ans+=m*j;
				m=lcm(m, m1);
				ok=1;
				break;
			}
		}
		if(!ok) return -1;
	}
	if(ans==0) return m;
	return ans;
}
int main()
{
	cin>>n>>k;
	for(int i=0; i<n; i++) p[i]=i;
	for(int i=0; i<k; i++){
		int x, y; cin>>x>>y;
		x--; y--;
		swap(p[x], p[y]);
	}
	bool used[110]={};
	for(int i=0; i<n; i++){
		if(used[i]) continue;
		int x=i;
		vector<int> w;
		while(!used[x]){
			w.push_back(x);
			used[x]=1;
			x=p[x];
		}
		v.push_back(w);
	}
	int q;
	cin>>q;
	for(int i=0; i<q; i++){
		vector<int> a(n);
		for(int j=0; j<n; j++){
			cin>>a[j]; a[j]--;
		}
		cout<<solve(a)<<endl;
	}
	return 0;
}