#include <bits/stdc++.h>
using namespace std;

using ll = long long;
#define int ll
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
using pii = pair<int, int>;
using vi = vector<int>;
#define fi first
#define se second
#define pb push_back

mt19937 rng(time(0));
vector<int> g[100500];
set<pair<int, int> > st;
int n = 10000;
int m = 200000;

void gen()
{
    st.clear();
    while (st.size() < m)
    {
        int a = rng()%n;
        int b = rng()%(n-1);
        if (b>=a) b++;
        if (b<a) swap(a, b);
        st.insert({a, b});
    }
    for (int i=0; i<n; i++)
        g[i].clear();
    for (auto [x, y] : st)
        g[x].pb(y), g[y].pb(x);
}

int p[100500];
int get(int v)
{
    if (v == p[v])
        return v;
    return p[v] = get(p[v]);
}
void un(int u, int v)
{
    u = get(u);
    v = get(v);
    p[u] = v;
}
bool ised(int v, int u)
{
    if (v > u)
        swap(v, u);
    return st.count({v, u});
}

int Q;
vector<int> ham()
{
    int v = 0;
    for (int i=1; i<n; i++)
        if (g[i].size() < g[v].size())
            v = i;
    vector<bool> used(n);
    int cnt = 1;
    used[v] = 1;
    int v0 = v;
    vector<int> nt(n, -1);
    vector<int> bd(n, -1);

    while (cnt < n)
    {
        int u = -1;
        for (int i : g[v])
            if (!used[i])
                if (u == -1 || g[i].size() < g[u].size())
                    u = i;
        if (u==-1)
        {
            int r = g[v][rand()%g[v].size()];
            int to = nt[r];
            nt[v] = r;
            nt[r] = v;

            v = to;
            while (v != r)
            {
                swap(nt[v], bd[v]);
                v = bd[v];
            }
            v = to;
            nt[v] = -1;

            continue;
        }
        nt[v] = u;
        bd[u] = v;
        v = u;
        used[v]=1;
        cnt++;
//        cout<<Q<<" "<<cnt<<endl;
    }
    vector<int> ans = {v0};
    for (int i=1; i<n; i++)
    {
        int v = nt[v0];
        ans.pb(v);
        v0 = v;
    }
    return ans;
}

void rm(int x, int y)
{
    for (int i=0; i<int(g[x].size()); i++)
        if (g[x][i] == y)
        {
            g[x].erase(g[x].begin()+i);
            break;
        }
}

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);
    int k=8;

    cin>>n>>m>>k;
    for (int i=0; i<m; i++)
    {
        int x, y;
        cin>>x>>y;
        x--;y--;
        if (x>y) swap(x, y);
        g[x].pb(y);
        g[y].pb(x);
        st.insert({x, y});
    }

//    while (true)
    {
//        gen();
        for (Q=1; Q<=k; Q++)
        {
            auto ans = ham();
            for (int i=0; i+1<n; i++)
            {
                int x = ans[i];
                int y = ans[i+1];
                if (x > y)
                    swap(x, y);
                if (!st.count({x, y}))
                    exit(3);
                st.erase({x, y});
                rm(x, y);
                rm(y, x);
            }
            for (int i : ans)
                cout<<i+1<<" ";
            cout<<endl;
        }
//        cout<<"OK"<<endl;
    }
}