#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define sz(x) int(x.size())
using namespace std;
const int MAXN=41;
ll tam;
vector<ll>vis;
vector<ll>grafo[MAXN];
vector<vector<int>>ans;
void dfs(ll nod)
{
vis[nod]=1;
vector<int>b(tam,nod), c;
c=b;
ll pos=0;
ans.pb(b);
for(auto k:grafo[nod])
{
c[pos]=k;
pos=pos+2;
}
ans.pb(c);
ans.pb(b);
for(auto k:grafo[nod])
{
if(vis[k]==1)
continue;
dfs(k);
ans.pb(b);
}
}
std::vector<std::vector<int>> create_map(int N, int M, std::vector<int> A, std::vector<int> B) {
vis.resize(N+1,0);
ll i;
tam=N*4;
for(i=0; i<int(A.size()); i++)
{
grafo[A[i]].pb(B[i]);
grafo[B[i]].pb(A[i]);
}
dfs(1);
while(int(ans.size())<tam)
ans.pb(ans.back());
//cout << sz(ans) << ' ' << sz(ans.back()) << endl;
return ans;
}
