#include <iostream>
#include <bits/stdc++.h>

using namespace std;

struct elem{
    int inf;
    elem *kov;
};

void beszuras(elem *first, int x){
    elem *p = new elem;
    p -> inf = x;
    p -> kov = first -> kov;
    first -> kov = p;

}

void kiir(elem *first){
    elem *p = first;
    while(p != NULL){
        cout << p -> inf << " ";
        p = p -> kov;
    }
    cout << endl;
}

void bejaras(elem *first[], vector <int> &lat, int k, int i){
    vector <int> v;
    v.push_back(i);
    lat[i] = k;
    int z;
    elem *p;
    while(v.size() != 0){
        z = v[0];
        v.erase(v.begin());
        p = first[z] -> kov;
        while(p != NULL){
            if(lat[p -> inf] == 0){
                v.push_back(p -> inf);
                lat[p -> inf] = k;
            }
            p = p -> kov;
        }
    }
}

int main()
{
    elem *a[100];
    int n, m, k;
    cin >> n >> m >> k;
    for(int i = 1; i <= n; i ++){
        a[i] = new elem;
        a[i] -> inf = 0;
        a[i] -> kov = NULL;
    }
    int x, y;
    for(int i = 1; i <= m; i ++){
        cin >> x >> y;
        beszuras(a[x], y);
        beszuras(a[y], x);
    }
    for(int i = 1; i <= n; i ++){
        cout << i << ":";
        kiir(a[i] -> kov);
    }
    vector <int> lat(n + 1, 0);
    int km = 0;
    for(int i = 1; i <= n; i++){
        if(lat[i] == 0){
            km ++;
            bejaras(a, lat, km, i);
        }
    }
    int db, mdb = 0, mind;
    for(int i = 1; i <= k; i ++){
        for(int j = 1; j <= n; j ++){
            if(lat[j] == i){
                db ++;
            }
        }
    }
    return 0;
}