190_E. Counter Attack

Berland has managed to repel the flatlanders' attack and is now starting the counter attack.

Flatland has n cities, numbered from 1 to n, and some pairs of them are connected by bidirectional roads. The Flatlandian maps show roads between cities if and only if there is in fact no road between this pair of cities (we do not know whether is it a clever spy-proof strategy or just saving ink). In other words, if two cities are connected by a road on a flatland map, then there is in fact no road between them. The opposite situation is also true: if two cities are not connected by a road on a flatland map, then in fact, there is a road between them.

The berlanders got hold of a flatland map. Now Vasya the Corporal is commissioned by General Touristov to find all such groups of flatland cities, that in each group of cities you can get from any city to any other one, moving along the actual roads. Also the cities from different groups are unreachable from each other, moving along the actual roads. Indeed, destroying such groups one by one is much easier than surrounding all Flatland at once!

Help the corporal complete this task and finally become a sergeant! Don't forget that a flatland map shows a road between cities if and only if there is in fact no road between them. 

Input

The first line contains two space-separated integers n and m (1 ≤ n ≤ 5·105, 0 ≤ m ≤ 106) — the number of cities and the number of roads marked on the flatland map, correspondingly.

Next m lines contain descriptions of the cities on the map. The i-th line contains two integers ai and bi (1 ≤ ai, bi ≤ n, ai ≠ bi) — the numbers of cities that are connected by the i-th road on the flatland map.

It is guaranteed that each pair of cities occurs in the input no more than once.

Output

On the first line print number k — the number of groups of cities in Flatland, such that in each group you can get from any city to any other one by flatland roads. At the same time, the cities from different groups should be unreachable by flatland roads.

On each of the following k lines first print ti (1 ≤ ti ≤ n) — the number of vertexes in the i-th group. Then print space-separated numbers of cities in the i-th group.

The order of printing groups and the order of printing numbers in the groups does not matter. The total sum ti for all k groups must equal n.

Examples

Input

4 4
1 2
1 3
4 2
4 3


Output

2
2 1 4 
2 2 3 


Input

3 1
1 2


Output

1
3 1 2 3 

Note

In the first sample there are roads only between pairs of cities 1-4 and 2-3.

In the second sample there is no road between cities 1 and 2, but still you can get from one city to the other one through city number 3.

Example input:
3 1
1 2

4 4
1 2
1 3
4 2
4 3


Example output:
1
3 1 3 2 

2
2 1 4 
2 2 3 


Tags: data structures
dsu
graphs
hashing
sortings
Difficulty rating: 2100

Solution:
#include <bits/stdc++.h>
using namespace std;
set<int> s;
set<pair<int, int> > m;
vector<int> ans[500005];
void dfs(int i, int c) {
  s.erase(i);
  ans[c].push_back(i);
  auto it = s.begin();
  while (it != s.end()) {
    int y = *it;
    if (m.find(make_pair(min(i, y), max(i, y))) == m.end()) dfs(y, c);
    it = s.upper_bound(y);
  }
}
int main() {
  int n, e, a, b;
  scanf("%d%d", &n, &e);
  for (int i = 1; i <= n; i++) s.insert(i);
  for (int i = 0; i < e; i++) {
    scanf("%d%d", &a, &b);
    m.insert(make_pair(min(a, b), max(a, b)));
  }
  int c = 0;
  for (int i = 1; i <= n; i++) {
    if (s.find(i) != s.end()) dfs(i, c++);
  }
  printf("%d\n", c);
  for (int i = 0; i < c; i++) {
    printf("%d ", ans[i].size());
    for (int j = 0; j < ans[i].size(); j++) printf("%d ", ans[i][j]);
    printf("\n");
  }
}