Problem: Ivan is a novice painter. He has n dyes of different colors. He also knows exactly m pairs of colors which harmonize with each other.

Ivan also enjoy playing chess. He has 5000 rooks. He wants to take k rooks, paint each of them in one of n colors and then place this k rooks on a chessboard of size 10^{9} × 10^{9}.

Let's call the set of rooks on the board connected if from any rook we can get to any other rook in this set moving only through cells with rooks from this set. Assume that rooks can jump over other rooks, in other words a rook can go to any cell which shares vertical and to any cell which shares horizontal.

Ivan wants his arrangement of rooks to have following properties:

  * For any color there is a rook of this color on a board;
  * For any color the set of rooks of this color is connected;
  * For any two different colors a b union of set of rooks of color a and set of rooks of color b is connected if and only if this two colors harmonize with each other.



Please help Ivan find such an arrangement.

Input

The first line of input contains 2 integers n, m (1 ≤ n ≤ 100, 0 ≤ m ≤ min(1000,    (n(n-1))/(2))) — number of colors and number of pairs of colors which harmonize with each other.

In next m lines pairs of colors which harmonize with each other are listed. Colors are numbered from 1 to n. It is guaranteed that no pair occurs twice in this list.

Output

Print n blocks, i-th of them describes rooks of i-th color.

In the first line of block print one number a_{i} (1 ≤ a_{i} ≤ 5000) — number of rooks of color i. In each of next a_{i} lines print two integers x and y (1 ≤ x,    y ≤ 10^{9}) — coordinates of the next rook.

All rooks must be on different cells.

Total number of rooks must not exceed 5000.

It is guaranteed that the solution exists.

Examples

Input

3 2
1 2
2 3


Output

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


Input

3 3
1 2
2 3
3 1


Output

1
1 1
1
1 2
1
1 3


Input

3 1
1 3


Output

1
1 1
1
2 2
1
3 1

Note

Rooks arrangements for all three examples (red is color 1, green is color 2 and blue is color 3).

<image>

<image>

<image>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int read() {
  int tot = 0, fh = 1;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') fh = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    tot = tot * 10 + c - '0';
    c = getchar();
  }
  return tot * fh;
}
void getstr(char *a) {
  char ch = getchar();
  int len = 0;
  while (ch < 'A' || ch > 'Z') ch = getchar();
  while (ch >= 'A' && ch <= 'Z') {
    a[++len] = ch;
    ch = getchar();
  }
}
const int maxn = 1e5 + 100;
struct compass {
  int nxt, dat;
} p[maxn * 2];
int n, m, tot, head[maxn], ans[2000], tx[2000][2000], ty[2000][2000], du[2000],
    pos[2000];
void connect(int x, int y) {
  tot++;
  p[tot].nxt = head[x];
  p[tot].dat = y;
  head[x] = tot;
}
int main() {
  n = read();
  m = read();
  for (int i = 1; i <= m; i++) {
    int x = read(), y = read();
    du[x]++;
    du[y]++;
    connect(x, y);
    connect(y, x);
  }
  int now = 0;
  for (int i = 1; i <= n; i++)
    if (du[i] == 0) {
      ans[i] = 1;
      tx[i][1] = now + 1;
      now++;
      ty[i][1] = i;
    }
  for (int i = 1; i <= n; i++) {
    pos[i] = now + 1;
    for (int j = now + 1; j <= now + du[i]; j++) {
      ans[i]++;
      tx[i][ans[i]] = j;
      ty[i][ans[i]] = i;
    }
    now = now + du[i];
    for (int j = head[i]; j; j = p[j].nxt)
      if (p[j].dat > i) {
        du[p[j].dat]--;
        ans[p[j].dat]++;
        tx[p[j].dat][ans[p[j].dat]] = pos[i];
        pos[i]++;
        ty[p[j].dat][ans[p[j].dat]] = p[j].dat;
      }
  }
  for (int i = 1; i <= n; i++) {
    cout << ans[i] << "\n";
    if (ans[i]) {
      for (int j = 1; j <= ans[i]; j++)
        cout << tx[i][j] << " " << ty[i][j] << "\n";
    }
  }
  return 0;
}