#include<bits/stdc++.h>
using namespace std;
mt19937 mt(time(NULL));
constexpr int M=10005;
vector<int>adj[M];
set<pair<int,int>>s;
int n,m,k;bool vis[M];
int read(){
    int x=0;char ch=getchar();
    while (!isdigit(ch)) ch=getchar();
    while (isdigit(ch)) x=x*10+ch-48,ch=getchar();
    return x;
}
int main(){
    n=read();m=read();k=read();
    for (int i=1;i<=m;i++)
        s.insert(minmax(read(),read()));
    while (k--){ vector<int>vec;
        vec.emplace_back(mt()%n+1);
        for (int i=1;i<=n;i++) adj[i].clear(),vis[i]=0;
        for (auto [x,y]:s)
            adj[x].emplace_back(y),
            adj[y].emplace_back(x);
        vis[vec.back()]=1;
        while (vec.size()<n){
            if (mt()&1) reverse(vec.begin(),vec.end());
            const int x=vec.back(); bool flag=0;
            shuffle(adj[x].begin(),adj[x].end(),mt);
            for (auto y:adj[x])
                if (!vis[y]){
                    vis[y]=flag=1;
                    vec.emplace_back(y);break;
                }
            if (flag) continue;
            for (int i=0;i<vec.size();i++)
                if (vec[i]==adj[x].back()){
                    reverse(vec.begin()+i+1,vec.end());
                    break;
                }
        }
        for (auto x:vec) printf("%d ",x); puts("");
        for (int i=1;i<vec.size();i++)
            s.erase(minmax(vec[i-1],vec[i]));
    }
    return 0;
}