wwwwavh rmeaj abfxcbzwrt2

#include <iostream>
#include <vector>
#include <set>
using namespace std;

void dfs(int v, vector <vector <int> > &g, vector <char> &used, vector <set<int>> &kk) {
    used[v] = true;
    for (int i = 0; i < g[v].size(); i++) {
        if (!used[g[v][i]]){
            dfs(g[v][i], g, used, kk);
            kk[g[v][i]].insert(i);
        }
    }
}

int main() {
    int n, m;
    cin >> n >> m;
    vector <vector <int>> g(n);

    for (int i = 0; i < m; i++){
        int u, v;
        cin >> u >> v;
        u--;
        v--;
        g[v].push_back(u);
        g[u].push_back(v);
    }

    int cmp_cnt = 0;

    vector <char> used(n, false);
    vector <set <int>> kk(n);

    for (int i = 0; i < n; i++){
        if (!used[i]){
            dfs(i, g, used, kk);
            cmp_cnt++;
        }
    }

    cout << cmp_cnt;
    for (int i=0; i<n; i++) {
        cout << i+1 << endl;
        for (int j : kk[i]) {
            cout << j << " ";
        } cout << endl;
    }
    return 0;
}