#include <bits/stdc++.h>

using namespace std;

const int N = 1e4 + 5;

set< pair<int, int> > S;
vector<int> G[N];
int vis[N];

signed main() {
    int n, m, k; scanf("%d%d%d", &n, &m, &k);
    while (m--) {
        int x, y; scanf("%d%d", &x, &y);
        S.insert(make_pair(min(x, y), max(x, y)));
    }
    mt19937 rnd(time(0));
    while (k--) {
        vector<int> p;
        p.push_back(rnd() % n + 1);
        for (int i = 1; i <= n; ++i) G[i].clear(), vis[i] = 0;
        vis[p.back()] = 1;
        for (auto [x, y] : S) G[x].push_back(y), G[y].push_back(x);
        while (p.size() != n) {
            if (rnd() & 1) reverse(p.begin(), p.end());
            int x = p.back(), fl = 0;
            shuffle(G[x].begin(), G[x].end(), rnd);
            for (auto v : G[x]) if (!vis[v]) {
                vis[v] = 1, p.push_back(v), fl = 1;
                break;
            }
            if (fl) continue;
            int t = G[x][0];
            for (int i = 0; ; ++i) if (p[i] == t) {
                reverse(p.begin() + i + 1, p.end());
                break;
            }
        }
        for (int i = 0; i < n; ++i) {
            printf("%d%c", p[i], " \n"[i == n - 1]);
            if (i) S.erase(make_pair(min(p[i - 1], p[i]), max(p[i - 1], p[i])));
        }
    }
    return 0;
}