Problem: The Committee for Research on Binary Viruses discovered a method of replication for a large family of viruses whose genetic codes are sequences of zeros and ones. Each virus originates from a single gene; for simplicity genes are denoted by integers from 0 to G - 1. At each moment in time a virus is a sequence of genes. When mutation occurs, one of the genes from the sequence is replaced by a certain sequence of genes, according to the mutation table. The virus stops mutating when it consists only of genes 0 and 1.

For instance, for the following mutation table: $$$ 2 → ⟨ 0\ 1 ⟩ \\\ 3 → ⟨ 2\ 0\ 0⟩\\\ 3 → ⟨ 1\ 3⟩\\\ 4 → ⟨ 0\ 3\ 1\ 2⟩\\\ 5 → ⟨ 2\ 1⟩\\\ 5 → ⟨ 5⟩  a virus that initially consisted of a single gene 4, could have mutated as follows:  ⟨ 4 ⟩ → ⟨ \underline{0\ 3\ 1\ 2} ⟩ → ⟨ 0\ \underline{2\ 0\ 0}\ 1\ 2 ⟩ → ⟨ 0\ \underline{0\ 1}\ 0\ 0\ 1\ 2 ⟩ → ⟨ 0\ 0\ 1\ 0\ 0\ 1\ \underline{0\ 1} ⟩  or in another way:  ⟨ 4 ⟩ → ⟨ \underline{0\ 3\ 1\ 2} ⟩ → ⟨ 0\ \underline{1\ 3}\ 1\ 2 ⟩ → ⟨ 0\ 1\ 3\ 1\ \underline{0\ 1} ⟩ → ⟨ 0\ 1\ \underline{2\ 0\ 0}\ 1\ 0\ 1 ⟩ → ⟨ 0\ 1\ \underline{0\ 1}\ 0\ 0\ 1\ 0\ 1 ⟩ $$$

Viruses are detected by antibodies that identify the presence of specific continuous fragments of zeros and ones in the viruses' codes. For example, an antibody reacting to a fragment ⟨ 0\ 0\ 1\ 0\ 0 ⟩ will detect a virus ⟨ 0\ 0\ 1\ 0\ 0\ 1\ 0\ 1 ⟩, but it will not detect a virus ⟨ 0\ 1\ 0\ 1\ 0\ 0\ 1\ 0\ 1 ⟩.

For each gene from 2 to G-1, the scientists are wondering whether a given set of antibodies is enough to detect all viruses that can emerge through mutations from this gene. If not, they want to know the length of the shortest virus that cannot be detected.

It may happen that sometimes scientists don't have any antibodies. Then of course no virus can be detected, so the scientists are only interested in the length of the shortest possible virus that can emerge from the gene mutations.

Input

The first line of the input will contain three integers G, N and M (G > 2, N ≥ G - 2, M ≥ 0) specifying the number of genes, the number of rows in the mutation table, and the number of antibodies.

The following N lines contain descriptions of rows of the mutation table; each line begins with two integers a and k (2 ≤ a < G, k ≥ 1), followed by a sequence of k integers b_1, b_2, …, b_k (0 ≤ b_i < G), that encode the row $$$ a → ⟨ b_1\ b_2\ …\ b_k ⟩ $$$

The sum of all values k does not exceed 100. Every integer from 2 to G - 1 appears in the table as a at least once.

The next M lines contain descriptions of the antibodies; each such line begins with an integer ℓ (ℓ ≥ 1), followed by a sequence of ℓ integers c_1, c_2, …, c_ℓ (0 ≤ c_i ≤ 1), describing the antibody. The sum of all values ℓ does not exceed 50.

Output

Your program needs to output exactly G - 2 lines, containing the answers for the subsequent genes from 2 to G - 1.

If all viruses that can mutate from this single gene can be detected by the given set of antibodies, you need to print the word "YES". You also need to print this if there are no viruses that could originate from this gene (it can happen when the sequences never stop mutating).

Otherwise you need to print the word "NO", followed by an integer denoting the minimal length of the undetectable virus. You can assume that for all the prepared input data this value will be smaller than 2^{63}.

Scoring

Subtasks: 

  1. (11 points) No antibodies (M = 0) 
  2. (14 points) N = G - 2 
  3. (25 points) One antibody (M = 1) 
  4. (32 points) The sum of all values ℓ does not exceed 10 
  5. (18 points) No further constraints 

Example

Input


6 6 2
2 2 0 1
3 3 2 0 0
3 2 1 3
4 4 0 3 1 2
5 2 2 1
5 1 5
2 1 1
5 0 0 1 0 0


Output


NO 2
NO 4
NO 9
YES

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
struct Aho_Corasick {
  static const int ALPHA = 2;
  static const int nax = 128;
  int nxt[nax][ALPHA] = {};
  int link[nax] = {};
  int val[nax] = {};
  int top = 0;
  void add_string(string const &s) {
    int v = 0;
    for (char ch : s) {
      int c = ch - 'a';
      if (nxt[v][c]) {
        v = nxt[v][c];
      } else {
        nxt[v][c] = ++top;
        v = top;
      }
    }
    ++val[v];
  }
  void add_string(vector<int> const &a) {
    int v = 0;
    for (int c : a) {
      if (nxt[v][c])
        v = nxt[v][c];
      else {
        nxt[v][c] = ++top;
        v = top;
      }
    }
    ++val[v];
  }
  void get_link() {
    static int q[nax];
    int topQ = 0;
    q[topQ++] = 0;
    for (int _i = 0; _i < topQ; ++_i) {
      int cur = q[_i];
      val[cur] += val[link[cur]];
      for (int i = 0; i < ALPHA; ++i) {
        if (nxt[cur][i]) {
          link[nxt[cur][i]] = cur ? nxt[link[cur]][i] : 0;
          q[topQ++] = nxt[cur][i];
        } else {
          nxt[cur][i] = nxt[link[cur]][i];
        }
      }
    }
  }
};
using ull = uint64_t;
const ull INF = 1ull << 63;
struct node_t {
  ull val;
  int from;
  int st;
  int en;
  node_t() : val(), from(), st(), en() {}
  node_t(ull val, int from, int st, int en)
      : val(val), from(from), st(st), en(en) {}
  bool operator<(const node_t &other) const { return val > other.val; }
};
priority_queue<node_t> pq;
Aho_Corasick dfa;
int n, g, m;
vector<int> e[228];
vector<pair<int, int>> el[228];
vector<pair<int, int>> er[228];
ull dp[220][220][220];
bool used[220][220][220];
int main() {
  scanf("%d %d %d", &g, &n, &m);
  int tot = g;
  for (int __ = 1; __ <= n; ++__) {
    static int c[150];
    int a, k;
    scanf("%d %d", &a, &k);
    for (int i = 1; i <= k; ++i) {
      scanf("%d", c + i);
    }
    if (k == 1) {
      e[c[1]].push_back(a);
    } else {
      int cur_a = a;
      for (int i = 1; i <= k - 2; ++i) {
        int new_gene = ++tot;
        er[c[i]].emplace_back(cur_a, new_gene);
        el[new_gene].emplace_back(cur_a, c[i]);
        cur_a = new_gene;
      }
      er[c[k - 1]].emplace_back(cur_a, c[k]);
      el[c[k]].emplace_back(cur_a, c[k - 1]);
    }
  }
  for (int __ = 1; __ <= m; ++__) {
    int len;
    scanf("%d", &len);
    vector<int> input(len);
    for (int &i : input) scanf("%d", &i);
    dfa.add_string(input);
  }
  dfa.get_link();
  for (int i = 0; i < 210; ++i)
    for (int j = 0; j < 210; ++j)
      for (int k = 0; k < 210; ++k) dp[i][j][k] = INF;
  for (int to_add = 0; to_add < 2; ++to_add) {
    for (int st = 0; st <= dfa.top; ++st) {
      if (dfa.val[st] == 0 && dfa.val[dfa.nxt[st][to_add]] == 0) {
        dp[to_add][st][dfa.nxt[st][to_add]] = 1;
        pq.emplace(1, to_add, st, dfa.nxt[st][to_add]);
      }
    }
  }
  while (!pq.empty()) {
    auto [val, node, st, en] = pq.top();
    pq.pop();
    if (used[node][st][en]) continue;
    used[node][st][en] = true;
    for (int to : e[node])
      if (dp[to][st][en] > val) {
        dp[to][st][en] = val;
        pq.emplace(val, to, st, en);
      }
    for (auto [x, y] : er[node]) {
      for (int new_ed = 0; new_ed <= dfa.top; ++new_ed) {
        if (dp[x][st][new_ed] > val + dp[y][en][new_ed]) {
          dp[x][st][new_ed] = val + dp[y][en][new_ed];
          pq.emplace(dp[x][st][new_ed], x, st, new_ed);
        }
      }
    }
    for (auto [x, y] : el[node]) {
      for (int new_st = 0; new_st <= dfa.top; ++new_st) {
        if (dp[x][new_st][en] > dp[y][new_st][st] + val) {
          dp[x][new_st][en] = dp[y][new_st][st] + val;
          pq.emplace(dp[x][new_st][en], x, new_st, en);
        }
      }
    }
  }
  for (int i = 2; i < g; ++i) {
    ull ans = INF;
    for (int j = 0; j <= dfa.top; ++j) {
      ans = min(ans, dp[i][0][j]);
    }
    if (ans == INF) {
      puts("YES");
    } else {
      printf("NO %llu\n", ans);
    }
  }
}