#include <bits/stdc++.h>

#define rep(i, j, k) for (int i = (j); i <= (k); ++i)
#define per(i, j, k) for (int i = (j); i >= (k); --i)
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
using ll = long long;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;

template<class T> void chkmn(T &x, T y) { if (y < x) x = y; }
template<class T> void chkmx(T &x, T y) { if (y > x) x = y; }

using namespace std;

const int mod = 1011451423;

inline void add(int &x, int y) { x += y; if (x >= mod) x -= mod; }
inline void sub(int &x, int y) { x -= y; if (x < 0) x += mod; }
inline int Add(int x, int y) { x += y; if (x >= mod) x -= mod; return x; }
inline int Sub(int x, int y) { x -= y; if (x < 0) x += mod; return x; }

const int maxn = 100010;
const int base = 133331;

int n, m, q, sz, tot, ct, ans[maxn], a[maxn], w[maxn], pw[maxn], t[maxn << 2], p[maxn], len[maxn], need[maxn];
pii opt[maxn];
pair<int, pii> js[maxn];
map<pii, vector<int>> que2;
vector<pii> que[maxn];

#define mid ((l + r) >> 1)

void build(int c, int l, int r) {
  if (l == r) return t[c] = l, void();
  build(c << 1, l, mid), build(c << 1 | 1, mid + 1, r);
  t[c] = Add(1ll * t[c << 1] * pw[r - mid] % mod, t[c << 1 | 1]);
}

void upd(int c, int l, int r, int x, int v) {
  if (l == r) return t[c] = v, void();
  if (x <= mid) upd(c << 1, l, mid, x, v);
  else upd(c << 1 | 1, mid + 1, r, x, v);
  t[c] = Add(1ll * t[c << 1] * pw[r - mid] % mod, t[c << 1 | 1]);
}

int qry(int c, int l, int r, int x, int y) {
  if (l == x && r == y) return t[c];
  if (y <= mid) return qry(c << 1, l, mid, x, y);
  else if (x > mid) return qry(c << 1 | 1, mid + 1, r, x, y);
  else return Add(1ll * qry(c << 1, l, mid, x, mid) * pw[y - mid] % mod, qry(c << 1 | 1, mid + 1, r, mid + 1, y));
}

#undef mid

void check(int d, int o) {
  int val = 0;
  rep (k, 0, 2) val = Add(1ll * val * base % mod, p[d + k]);
  int id = lower_bound(w + 1, w + tot + 1, val) - w;
  if (w[id] != val) return;
  vector<pii> nxt;
  for (auto [x, s] : que[id]) {
    int L = d - s + 1, R = L + len[x] - 1;
    if (L >= 1 && R <= n && need[x] == qry(1, 1, n, L, R)) chkmn(ans[x], o);
    else nxt.emplace_back(x, s);
  }
  que[id] = nxt;
}

int main() {
  cin.tie(nullptr) -> ios::sync_with_stdio(false);
  cin >> n >> m >> q;
  pw[0] = 1;
  rep (i, 1, n) pw[i] = 1ll * pw[i - 1] * base % mod;
  rep (i, 1, m) cin >> opt[i].fi >> opt[i].se;
  rep (i, 1, q) {
    cin >> sz, len[i] = sz;
    rep (j, 1, sz) cin >> a[j];
    int ok = 1;
    rep (j, 1, sz - 1) ok &= (a[j + 1] == a[j] + 1);
    if (!ok) {
      ans[i] = m + 1;
      if (sz == 2) {
        que2[pii(a[1], a[2])].emplace_back(i);
      } else {
        rep (j, 1, sz - 2) {
          int val = 0;
          rep (k, 0, 2) val = Add(1ll * val * base % mod, a[j + k]);
          js[++tot] = make_pair(val, pii(i, j));
        }
        need[i] = 0;
        rep (j, 1, sz) need[i] = Add(1ll * need[i] * base % mod, a[j]);
      }
    }
  }
  sort(js + 1, js + tot + 1), ct = tot, tot = 0;
  rep (i, 1, ct) if (i == 1 || js[i].fi != js[i - 1].fi) w[++tot] = js[i].fi;
  rep (i, 1, ct) que[lower_bound(w + 1, w + tot + 1, js[i].fi) - w].emplace_back(js[i].se);
  build(1, 1, n);
  rep (i, 1, n) p[i] = i;
  rep (i, 1, m) {
    auto [x, y] = opt[i];
    upd(1, 1, n, x, p[y]), upd(1, 1, n, y, p[x]), swap(p[x], p[y]);
    if (x > 1 && que2.count(pii(p[x - 1], p[x]))) {
      for (int id : que2[pii(p[x - 1], p[x])]) chkmn(ans[id], i);
      que2.erase(pii(p[x - 1], p[x]));
    }
    if (y > 1 && que2.count(pii(p[y - 1], p[y]))) {
      for (int id : que2[pii(p[y - 1], p[y])]) chkmn(ans[id], i);
      que2.erase(pii(p[y - 1], p[y]));
    }
    if (x < n && que2.count(pii(p[x], p[x + 1]))) {
      for (int id : que2[pii(p[x], p[x + 1])]) chkmn(ans[id], i);
      que2.erase(pii(p[x], p[x + 1]));
    }
    if (y < n && que2.count(pii(p[y], p[y + 1]))) {
      for (int id : que2[pii(p[y], p[y + 1])]) chkmn(ans[id], i);
      que2.erase(pii(p[y], p[y + 1]));
    }
    rep (d, x - 2, x) if (d >= 1 && d + 2 <= n) check(d, i);
    rep (d, y - 2, y) if (d >= 1 && d + 2 <= n) check(d, i);
  }
  rep (i, 1, q) cout << ans[i] << '\n';
}