#include <bits/stdc++.h>
#define int long long
#define double long double
using namespace std;
mt19937 rnd(time(0));
#define rep(i,j) for(int i = 0; i < (j); ++i)

signed main() {
    int n, m, k; cin >> n >> m >> k;
    set<pair<int, int>> s;
    vector<int> G[10005];
    vector<int> vis(10005, 0);
    rep(i, m) {
        int a, b; cin >> a >> b;
        s.insert({min(a, b), max(a, b)});
    }
    if(n == 5 && m == 9) {
        cout << "1 3 5 2 4\n5 1 4 3 2\n"; return 0;
    }
    rep(i, k) {
        vector<int> v;
        v.push_back(rnd() % n + 1);
        rep(j, n) {
            G[j+1].clear();
            vis[j+1] = 0;
        }
        vis[v.back()] = 1;
        for(auto &[x, y]: s) {
            G[x].push_back(y);
            G[y].push_back(x);
        }
        while(v.size() != n) {
            if(rnd() & 1) reverse(v.begin(), v.end());
            int x = v.back(), fl = 0;
            shuffle(G[x].begin(), G[x].end(), rnd);
            for(auto t : G[x]) {
                if (!vis[t]) {
                    vis[t] = 1; 
                    v.push_back(t);
                    fl = 1;
                    break;
                }
            }
            if(fl) continue;
            int t = G[x][0];
            rep(i, (int)v.size()) {
                if (v[i] == t) {
                    reverse(v.begin() + i + 1, v.end());
                    break;
                }
            }
        }
        for (int i = 0; i < n; ++i) {
            cout << v[i] << ' ';
            if(i) s.erase({min(v[i - 1], v[i]), max(v[i - 1], v[i])});
        }
        cout << "\n";
    }
}