Problem: Little Vasya likes very much to play with sets consisting of positive integers. To make the game more interesting, Vasya chose n non-empty sets in such a way, that no two of them have common elements.

One day he wanted to show his friends just how interesting playing with numbers is. For that he wrote out all possible unions of two different sets on n·(n - 1) / 2 pieces of paper. Then he shuffled the pieces of paper. He had written out the numbers in the unions in an arbitrary order.

For example, if n = 4, and the actual sets have the following form {1, 3}, {5}, {2, 4}, {7}, then the number of set pairs equals to six. The six pieces of paper can contain the following numbers: 

  * 2, 7, 4. 
  * 1, 7, 3; 
  * 5, 4, 2; 
  * 1, 3, 5; 
  * 3, 1, 2, 4; 
  * 5, 7. 



Then Vasya showed the pieces of paper to his friends, but kept the n sets secret from them. His friends managed to calculate which sets Vasya had thought of in the first place. And how about you, can you restore the sets by the given pieces of paper?

Input

The first input file line contains a number n (2 ≤ n ≤ 200), n is the number of sets at Vasya's disposal. Then follow sets of numbers from the pieces of paper written on n·(n - 1) / 2 lines. Each set starts with the number ki (2 ≤ ki ≤ 200), which is the number of numbers written of the i-th piece of paper, and then follow ki numbers aij (1 ≤ aij ≤ 200). All the numbers on the lines are separated by exactly one space. It is guaranteed that the input data is constructed according to the above given rules from n non-intersecting sets.

Output

Print on n lines Vasya's sets' description. The first number on the line shows how many numbers the current set has. Then the set should be recorded by listing its elements. Separate the numbers by spaces. Each number and each set should be printed exactly once. Print the sets and the numbers in the sets in any order. If there are several answers to that problem, print any of them.

It is guaranteed that there is a solution.

Examples

Input

4
3 2 7 4
3 1 7 3
3 5 4 2
3 1 3 5
4 3 1 2 4
2 5 7


Output

1 7 
2 2 4 
2 1 3 
1 5 


Input

4
5 6 7 8 9 100
4 7 8 9 1
4 7 8 9 2
3 1 6 100
3 2 6 100
2 1 2


Output

3 7 8 9 
2 6 100 
1 1 
1 2 


Input

3
2 1 2
2 1 3
2 2 3


Output

1 1 
1 2 
1 3 

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int n, m, g[20005][205];
map<int, int> mm;
int idx;
int pre[40005];
int x[40050];
bool flag[40050];
int f[40005][205];
int cnt[40050];
struct Node {
  int v, next;
} node[40050];
int e, first[40050];
void init() {
  e = 0;
  memset(first, -1, sizeof(first));
}
void add_edge(int u, int v) {
  node[e].v = v;
  node[e].next = first[u];
  first[u] = e++;
}
int find(int k) {
  if (pre[k] == k)
    return k;
  else
    return pre[k] = find(pre[k]);
}
bool judge(int u, int v) {
  if (f[u][0] != f[v][0]) return false;
  for (int i = 0; i <= f[u][0]; i++)
    if (f[u][i] != f[v][i]) return false;
  return true;
}
int main() {
  int pos, now, next;
  int cc;
  while (scanf("%d", &n) == 1) {
    m = n * (n - 1) / 2;
    mm.clear();
    idx = 0;
    for (int i = 0; i < m; i++) {
      scanf("%d", &g[i][0]);
      for (int j = 1; j <= g[i][0]; j++) {
        scanf("%d", &g[i][j]);
        if (mm.find(g[i][j]) == mm.end()) {
          x[idx] = g[i][j];
          f[idx][0] = 0;
          f[idx][++f[idx][0]] = i;
          mm[g[i][j]] = idx++;
        } else {
          now = mm[g[i][j]];
          f[now][++f[now][0]] = i;
        }
      }
    }
    if (n == 2) {
      printf("%d %d\n", 1, g[0][1]);
      printf("%d", g[0][0] - 1);
      for (int i = 2; i <= g[0][0]; i++) printf(" %d", g[0][i]);
      printf("\n");
      continue;
    }
    memset(flag, false, sizeof(flag));
    for (int i = 0; i < idx; i++) pre[i] = i;
    for (int i = 0; i < m; i++)
      for (int j = 1; j <= g[i][0]; j++) {
        now = mm[g[i][j]];
        if (!flag[now]) {
          flag[now] = true;
          for (int k = 1; k <= g[i][0]; k++)
            if (k != j) {
              next = mm[g[i][k]];
              if (find(now) != find(next) && judge(now, next))
                pre[find(now)] = find(next);
            }
        }
      }
    cc = 0;
    for (int i = 0; i < idx; i++)
      if (find(i) == i) cc++;
    pos = 0;
    now = find(0);
    while (cc > n) {
      if (pos == n) pos = 0;
      if (find(pos) == now)
        pos++;
      else {
        pre[find(pos)] = now;
        cc--;
      }
    }
    init();
    memset(cnt, 0, sizeof(cnt));
    for (int i = 0; i < idx; i++) {
      add_edge(find(i), i);
      cnt[find(i)]++;
    }
    for (int i = 0; i < idx; i++)
      if (find(i) == i) {
        printf("%d", cnt[i]);
        for (int j = first[i]; j != -1; j = node[j].next) {
          printf(" %d", x[node[j].v]);
        }
        printf("\n");
      }
  }
  return 0;
}