Problem: Nikola owns a large warehouse which is illuminated by N light bulbs, numbered 1 to N. At the exit of the warehouse, there are S light switches, numbered 1 to S. Each switch swaps the on/off state for some light bulbs, so if a light bulb is off, flipping the switch turns it on, and if the light bulb is on, flipping the switch turns it off.

At the end of the day, Nikola wants to turn all the lights off. To achieve this, he will flip some of the light switches at the exit of the warehouse, but since Nikola is lazy, he wants to flip the _minimum_ number of switches required to turn all the lights off. Since Nikola was not able to calculate the minimum number of switches, he asked you to help him. During a period of D days, Nikola noted which light bulbs were off and which were on at the end of each day. He wants you to tell him the minimum number of switches he needed to flip to turn all the lights off for each of the D days or tell him that it's impossible.

Input

First line contains three integers, N, S and D (1 ≤ N ≤ 10^3, 1 ≤ S ≤ 30, 1 ≤ D ≤ 10^3) – representing number of light bulbs, the number of light switches, and the number of days respectively.

The next S lines contain the description of each light switch as follows: The first number in the line, C_i (1 ≤ C_i ≤ N), represents the number of light bulbs for which the on/off state is swapped by light switch i, the next C_i numbers (sorted in increasing order) represent the indices of those light bulbs.

The next D lines contain the description of light bulbs for each day as follows: The first number in the line, T_i (1 ≤ T_i ≤ N), represents the number of light bulbs which are on at the end of day i, the next T_i numbers (sorted in increasing order) represent the indices of those light bulbs.

Output

Print D lines, one for each day. In the i^{th} line, print the minimum number of switches that need to be flipped on day i, or -1 if it's impossible to turn all the lights off.

Example

Input


4 3 4
2 1 2
2 2 3
1 2
1 1
2 1 3
3 1 2 3
3 1 2 4


Output


2
2
3
-1

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int next_x[8] = {0, 1, -1, 0, 1, 1, -1, -1};
const int next_y[8] = {1, 0, 0, -1, 1, -1, -1, 1};
const int inf = 1e9 + 5;
const long long linf = 1e18 + 5;
const double PI = acos(-1.0);
const double eps = 1e-8;
const int MAXN = 2e4 + 10;
const int N = 1005;
const int fix = 500 * 500 + 5;
int n, s, d, m;
vector<pair<bitset<N>, int>> v1, v2;
bitset<N> cur, a[31];
unordered_map<bitset<N>, int> g;
void dfs1(int i, int num) {
  if (i == m + 1) return void(v1.push_back({cur, num}));
  dfs1(i + 1, num), cur ^= a[i], dfs1(i + 1, num + 1), cur ^= a[i];
}
void dfs2(int i, int num) {
  if (i == s + 1) return void(v2.push_back({cur, num}));
  dfs2(i + 1, num), cur ^= a[i], dfs2(i + 1, num + 1), cur ^= a[i];
}
int work() {
  scanf("%d%d%d", &n, &s, &d), m = min(10, max(s - s / 2, s / 2));
  for (register int i = (1), I = (s) + 1; i < I; ++i) {
    int c, x;
    scanf("%d", &c);
    while (c--) scanf("%d", &x), a[i][x] = 1;
  }
  dfs1(1, 0), dfs2(m + 1, 0);
  for (auto p : v2) {
    if (!g.count(p.first))
      g[p.first] = p.second;
    else
      g[p.first] = min(g[p.first], p.second);
  }
  while (d--) {
    bitset<N> q;
    int ans = inf, c, x;
    scanf("%d", &c);
    while (c--) scanf("%d", &x), q[x] = 1;
    if (g.count(q)) ans = g[q];
    for (auto p : v1) {
      if (p.first == q) ans = min(ans, p.second);
      bitset<N> req = (q ^ p.first);
      if (g.count(req)) ans = min(ans, g[req] + p.second);
    }
    printf("%d\n", ans == inf ? -1 : ans);
  }
  return 0;
}
int main() {
  work();
  return 0;
}