#include <string.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#pragma GCC optimize("Ofast")
using namespace std;

using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
template <typename T> using vc = vector<T>;
template <typename T> using vvc = vector<vector<T>>;
template <typename T> using vvvc = vector<vector<vector<T>>>;
template<class T> using pq = priority_queue<T,vector<T>,greater<T>>;
template <class T, class S> inline bool chmax(T &a, const S &b) { return (a < b ? a = b, 1 : 0); }
template <class T, class S> inline bool chmin(T &a, const S &b) { return (a > b ? a = b, 1 : 0); }

int dx4[] = {1,0,-1,0};
int dy4[] = {0,1,0,-1};

#define overload5(a, b, c, d, e, name, ...) name
#define overload4(a, b, c, d, name, ...) name
#define REP0(n) for(ll jidlsjf = 0; jidlsjf < n; ++jidlsjf)
#define REP1(i, n) for(ll i = 0; i < (n); ++i)
#define REP2(i, a, b) for(ll i = (a); i < (b); ++i)
#define REP3(i, a, b, c) for(ll i = (a); i < (b); i += (c))
#define rep(...) overload4(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)
#define per0(n) for(int jidlsjf = 0; jidlsjf < (n); ++jidlsjf)
#define per1(i, n) for(ll i = (n)-1; i >= 0; --i)
#define per2(i, a, b) for(ll i = (a)-1; i >= b; --i)
#define per3(i, a, b, c) for(ll i = (a)-1; i >= (b); i -= (c))
#define per(...) overload4(__VA_ARGS__, per3, per2, per1, per0)(__VA_ARGS__)
#define fi first
#define se second
#define pb push_back
#define ppb pop_back
#define ppf pop_front
#define drop(s) cout << #s << endl, exit(0)
#define si(c) (int)(c).size()
#define lb(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define lbg(c, x) distance((c).begin(), lower_bound(all(c), (x), greater{}))
#define ub(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define ubg(c, x) distance((c).begin(), upper_bound(all(c), (x), greater{}))
#define rng(v, l, r) v.begin() + (l), v.begin() + (r)
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define SORT(v) sort(all(v))
#define REV(v) reverse(all(v))
#define UNIQUE(x) SORT(x), x.erase(unique(all(x)), x.end())
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define overload2(_1, _2, name, ...) name
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define vv(type, name, h, ...) vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define vvv(type, name, h, w, ...) vector<vector<vector<type>>> name(h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))

constexpr int mod1 = 998244353;
constexpr int mod2 = 1000000007;


int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n,m,q;
    cin >> n >> m >> q;
    vc<int>a(n);
    iota(all(a),0);
    if(n <= 30) {
        vc<int>x(m),y(m);
        rep(i,m) {
            cin >> x[i] >> y[i];
            x[i]--;
            y[i]--;
        }
        vc<int>ans(q,-1);
        map<pii,vc<int>>mp;
        rep(i,q) {
            int k;
            cin >> k;
            vc<int>b(k);
            bool f = true;
            int sum1 = 0,sum2 = 0;
            rep(i,k) {
                cin >> b[i];
                b[i]--;
                sum1 = (37ll*sum1+b[i]+1)%mod1;
                sum2 = (41ll*sum2+b[i]+1)%mod2;
                if(b[i] != i+b[0]) {
                    f = false;
                }
            }
            if(f) {
                ans[i] = 0;
            }
            else {
                mp[{sum1,sum2}].pb(i);
            }
        }
        rep(i,m) {
            swap(a[x[i]],a[y[i]]);
            rep(j,n) {
                int sum1 = 0,sum2 = 0;
                rep(k,j,n) {
                    sum1 = (37ll*sum1+a[k]+1)%mod1;
                    sum2 = (41ll*sum2+a[k]+1)%mod2;
                    if(mp.count({sum1,sum2})) {
                        for(auto l:mp[{sum1,sum2}]) {
                            ans[l] = i+1;
                        }
                        mp.erase({sum1,sum2});
                    }
                }
            }
        }
        rep(i,q) {
            cout << ans[i] << "\n";
        }
        return 0;
    }
    else if(n <= 200) {
        vc<int>x(m),y(m);
        rep(i,m) {
            cin >> x[i] >> y[i];
            x[i]--;
            y[i]--;
        }
        vc<int>ans(q,-1);
        vvvc<int>res(n,vvc<int>(n));
        vvc<int>b(q);
        rep(i,q) {
            int k;
            cin >> k;
            bool f = true;
            b[i].resize(k);
            rep(j,k) {
                cin >> b[i][j];
                b[i][j]--;
                if(b[i][j] != j+b[i][0]) {
                    f = false;
                }
            }
            if(f) {
                ans[i] = 0;
            }
            else {
                res[b[i][0]][b[i][1]].pb(i);
            }
        }
        rep(i,m) {
            swap(a[x[i]],a[y[i]]);
            rep(j,n-1) {
                vc<int>nxt;
                for(auto k:res[a[j]][a[j+1]]) {
                    if(j+si(b[k])-1 >= n) {
                        nxt.pb(k);
                        continue;
                    }
                    bool f = true;
                    rep(l,si(b[k])) {
                        if(a[j+l] != b[k][l]) {
                            f = false;
                            break;
                        }
                    }
                    if(f) {
                        ans[k] = i+1;
                    }
                    else {
                        nxt.pb(k);
                    }
                } 
                res[a[j]][a[j+1]] = nxt;
            }
        }
        rep(i,q) {
            cout << ans[i] << "\n";
        }
        return 0;
    }
    vvc<pii>query(n);
    rep(i,m) {
        int x,y;
        cin >> x >> y;
        x--;
        y--;
        query[a[x]].pb({i,y});
        query[a[y]].pb({i,x});
        swap(a[x],a[y]);
    }
    rep(t,q) {
        int k;
        cin >> k;
        vc<int>b(k);
        vc<array<int,3>>res;
        rep(i,k) {
            cin >> b[i];
            b[i]--;
            for(auto j:query[b[i]]) {
                res.pb({j.fi,(int)i,j.se});
            }
        }
        SORT(res);
        vc<int>now(k);
        int cnt = 0;
        rep(i,k) {
            now[i] = b[i];
            if(i && b[i-1] > b[i]) {
                cnt++;
            }
        }
        if(cnt == 0 && b[k-1]-b[0] == k-1) {
            cout << 0 << "\n";
            continue;
        }
        rep(i,si(res)) {
            int id = res[i][1];
            if(id && b[id-1] > b[id]) cnt--;
            if(id+1 < k && b[id] > b[id+1]) cnt--;
            b[id] = res[i][2];
            if(id && b[id-1] > b[id]) cnt++;
            if(id+1 < k && b[id] > b[id+1]) cnt++;
            if(i+1 == si(res) || res[i+1][0] != res[i][0]) {
                if(cnt == 0 && b[k-1]-b[0] == k-1) {
                    cout << res[i][0]+1 << "\n";
                    break;
                }
            }
        }
    }
}