#include <iostream>
#include <stdio.h>
#include <string.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <vector>
#include <math.h>
#include <bitset>
#include <algorithm>
using namespace std;
#define X first
#define Y second
#define eps 1e-2
#define gcd __gcd
#define pb push_back
#define PI acos(-1.0)
#define lowbit(x) (x)&(-x)
#define bug printf("!!!!!\n");
#define mem(x,y) memset(x,y,sizeof(x))
typedef long long LL;
typedef long double LD;
typedef pair<int,int> pii;
typedef unsigned long long uLL;
const int N = 1e6+2;
const int INF = 1<<30;
const int mod = 1e9+7;
std::vector<int> v[N];
int n,m,k;
int ans[N],cnt=-1,vis[N];
void dfs(int x,int fa){
ans[++cnt]=x;
vis[x]=1;
for(int i=0;i<v[x].size();i++){
int to=v[x][i];if(to==fa||vis[to]==1) continue;
dfs(to,x);
ans[++cnt]=x;
}
}
void solve(){
scanf("%d%d%d",&n,&m,&k);
if(n==1){
for(int i=1;i<=k;i++){
printf("1 1\n");
return ;
}
}
for(int i=1;i<=m;i++){
int x,y;scanf("%d%d",&x,&y);
v[x].push_back(y);
v[y].push_back(x);
}
dfs(1,0);
int can=(2*n%k==0?2*n/k:2*n/k+1);
for(int i=1,now=0;i<=k;i++){
printf("%d ",can);
for(int j=1;j<=can;j++,++now){
printf("%d ",ans[now%cnt]);
}
cout<<endl;
}
return;
}
int main()
{
int t = 1;
while(t--){
solve();
}
return 0;
}