#include using namespace std; typedef long long signed int LL; typedef long long unsigned int LU; #define incID(i, l, r) for(int i = (l) ; i < (r); i++) #define incII(i, l, r) for(int i = (l) ; i <= (r); i++) #define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--) #define decII(i, l, r) for(int i = (r) ; i >= (l); i--) #define inc(i, n) incID(i, 0, n) #define inc1(i, n) incII(i, 1, n) #define dec(i, n) decID(i, 0, n) #define dec1(i, n) decII(i, 1, n) #define inII(v, l, r) ((l) <= (v) && (v) <= (r)) #define inID(v, l, r) ((l) <= (v) && (v) < (r)) #define PB push_back #define EB emplace_back #define MP make_pair #define FI first #define SE second #define UB upper_bound #define LB lower_bound #define PQ priority_queue #define ALL(v) v.begin(), v.end() #define RALL(v) v.rbegin(), v.rend() #define FOR(it, v) for(auto it = v.begin(); it != v.end(); ++it) #define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it) template bool setmin(T & a, T b) { if(b < a) { a = b; return true; } else { return false; } } template bool setmax(T & a, T b) { if(b > a) { a = b; return true; } else { return false; } } template bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } } template bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } } template T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); } template T lcm(T a, T b) { return a / gcd(a, b) * b; } // ---- ---- int n, k, q, p[100][200], a[100]; LL ex_gcd(LL a, LL b, LL & x, LL & y) { LL d = a; if(b != 0) { d = ex_gcd(b, a % b, y, x); y -= (a / b) * x; } else { x = 1; y = 0; } return d; } LL solve() { LL r1 = 0, m1 = 1; inc(j, n) { int b[2], c = 0; inc(i, n * 2) { if(p[i][j] == a[j]) { b[c++] = i; } if(c == 2) { break; } } if(c != 2) { return -1; } LL r2 = b[0], m2 = b[1] - b[0], k1, k2, d; d = ex_gcd(m1, m2, k1, k2); if((r2 - r1) % d != 0) { return -1; } if(k1 < 0) { k1 += m2; } k1 *= (r2 - r1); r1 += k1 * m1; m1 *= m2 / d; r1 %= m1; } return r1 + 1; } int main() { cin >> n >> k; inc(i, n) { p[0][i] = i; } inc(i, k) { int x, y; cin >> x >> y; x--; y--; swap(p[0][x], p[0][y]); } inc(i, 2 * n - 1) { inc(j, n) { p[i + 1][j] = p[i][p[0][j]]; } } cin >> q; inc(Q, q) { inc(i, n) { cin >> a[i]; a[i]--; } cout << solve() << "\n"; } return 0; }