Problem: Everybody knows that we have been living in the Matrix for a long time. And in the new seventh Matrix the world is ruled by beavers.

So let's take beaver Neo. Neo has so-called "deja vu" outbursts when he gets visions of events in some places he's been at or is going to be at. Let's examine the phenomenon in more detail.

We can say that Neo's city is represented by a directed graph, consisting of n shops and m streets that connect the shops. No two streets connect the same pair of shops (besides, there can't be one street from A to B and one street from B to A). No street connects a shop with itself. As Neo passes some streets, he gets visions. No matter how many times he passes street k, every time he will get the same visions in the same order. A vision is a sequence of shops.

We know that Neo is going to get really shocked if he passes the way from some shop a to some shop b, possible coinciding with a, such that the list of visited shops in the real life and in the visions coincide.

Suggest beaver Neo such path of non-zero length. Or maybe you can even count the number of such paths modulo 1000000007 (109 + 7)?..

Input

The first line contains integers n and m — the number of shops and the number of streets, correspondingly, 1 ≤ n ≤ 50, <image>. Next m lines contain the descriptions of the streets in the following format: xi yi ki v1 v2 ... vk, where xi and yi (1 ≤ xi, yi ≤ n, xi ≠ yi) are indices of shops connected by a street, ki (0 ≤ ki ≤ n) is the number of visions on the way from xi to yi; v1, v2, ..., vk (1 ≤ vi ≤ n) describe the visions: the numbers of the shops Neo saw. Note that the order of the visions matters.

It is guaranteed that the total number of visions on all streets doesn't exceed 105.

  * to get 50 points, you need to find any (not necessarily simple) path of length at most 2·n, that meets the attributes described above (subproblem E1); 
  * to get 50 more points, you need to count for each length from 1 to 2·n the number of paths that have the attribute described above (subproblem E2). 

Output

Subproblem E1. In the first line print an integer k (1 ≤ k ≤ 2·n) — the numbers of shops on Neo's path. In the next line print k integers — the number of shops in the order Neo passes them. If the graph doesn't have such paths or the length of the shortest path includes more than 2·n shops, print on a single line 0.

Subproblem E2. Print 2·n lines. The i-th line must contain a single integer — the number of required paths of length i modulo 1000000007 (109 + 7).

Examples

Input

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


Output

4
6 1 2 3


Input

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


Output

1
2
1
1
2
1
1
2
1
1
2
1

Note

The input in both samples are the same. The first sample contains the answer to the first subproblem, the second sample contains the answer to the second subproblem.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
namespace FGF {
int n, m;
const int N = 55, M = N * N, mo = 1e9 + 7;
vector<int> s[M];
vector<int>::iterator it;
vector<int>::reverse_iterator rit;
int g[N][N], is[M], u[M], v[M], w[M], f[N << 1][N][2], cnt, head[N];
queue<int> q;
struct edg {
  int to, nxt, w;
  bool e, s;
} e[M << 1];
void add(int u, int v, bool s, bool ed, int w) {
  e[++cnt].to = v;
  e[cnt].nxt = head[u];
  e[cnt].e = ed, e[cnt].s = s, e[cnt].w = w;
  head[u] = cnt;
}
void work() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= m; i++) {
    is[i] = -1;
    scanf("%d%d%d", &u[i], &v[i], &w[i]);
    for (int j = 1, x; j <= w[i]; j++) scanf("%d", &x), s[i].push_back(x);
    g[u[i]][v[i]] = i;
    for (int j = 0; j < w[i] - 1; j++)
      if (s[i][j] == u[i] && s[i][j + 1] == v[i]) is[i] = j;
  }
  for (int i = 1; i <= m; i++) {
    if (~is[i]) {
      int len = 1, S, E;
      while (q.size()) q.pop();
      for (int j = is[i] - 1; j >= 0; j--) q.push(s[i][j]);
      S = u[i];
      while (q.size()) {
        int x = q.front();
        q.pop();
        len++;
        if (len > 2 * n) goto END;
        if (!g[x][S]) goto END;
        if (s[g[x][S]].size())
          for (rit = s[g[x][S]].rbegin(); rit != s[g[x][S]].rend(); rit++)
            q.push(*rit);
        S = x;
      }
      while (q.size()) q.pop();
      for (int j = is[i] + 2; j < w[i]; j++) q.push(s[i][j]);
      E = v[i];
      while (q.size()) {
        int x = q.front();
        q.pop();
        len++;
        if (len > 2 * n) goto END;
        if (!g[E][x]) goto END;
        if (s[g[E][x]].size())
          for (it = s[g[E][x]].begin(); it != s[g[E][x]].end(); it++)
            q.push(*it);
        E = x;
      }
      add(S, E, 1, 1, len);
    } else if (s[i].size() && *s[i].rbegin() == u[i]) {
      int len = 1, S = u[i], E = v[i];
      while (q.size()) q.pop();
      for (int j = w[i] - 2; j >= 0; j--) q.push(s[i][j]);
      while (q.size()) {
        int x = q.front();
        q.pop();
        len++;
        if (len > 2 * n) goto END;
        if (!g[x][S]) goto END;
        if (s[g[x][S]].size())
          for (rit = s[g[x][S]].rbegin(); rit != s[g[x][S]].rend(); rit++)
            q.push(*rit);
        S = x;
      }
      add(S, E, 1, 0, len);
    } else if (s[i].size() && *s[i].begin() == v[i]) {
      int len = 1, S = u[i], E = v[i];
      while (q.size()) q.pop();
      for (int j = 1; j < w[i]; j++) q.push(s[i][j]);
      while (q.size()) {
        int x = q.front();
        q.pop();
        len++;
        if (len > 2 * n) goto END;
        if (!g[E][x]) goto END;
        if (s[g[E][x]].size())
          for (it = s[g[E][x]].begin(); it != s[g[E][x]].end(); it++)
            q.push(*it);
        E = x;
      }
      add(S, E, 0, 1, len);
    }
    if (w[i] == 0) add(u[i], v[i], 0, 0, 1);
  END:;
  }
  for (int i = 1; i <= n; i++) f[0][i][0] = 1;
  for (int l = 0; l <= 2 * n; l++)
    for (int x = 1; x <= n; x++)
      for (int i = head[x]; i; i = e[i].nxt)
        (f[l + e[i].w][e[i].to][e[i].e] += f[l][x][e[i].s ^ 1]) %= mo;
  for (int l = 1; l <= 2 * n; l++) {
    int ans = 0;
    for (int i = 1; i <= n; i++) ans = (ans + f[l][i][1]) % mo;
    printf("%d\n", ans);
  }
}
}  // namespace FGF
int main() {
  FGF::work();
  return 0;
}