#include "worldmap.h"
#include <bits/stdc++.h>
using namespace std;
const int M = 41;
int n;
vector<int> nei[M];
bool vis[M];
vector<vector<int>> ans;
void dfs(int u)
{
vis[u]=1;
for (int i:nei[u])
if (!vis[i])
ans.push_back(vector<int>(4*n,u)), dfs(i);
ans.push_back(vector<int>(4*n,u));
ans.push_back({});
for (int i:nei[u])
ans.back().push_back(i), ans.back().push_back(u);
while (ans.back().size()<4*n) ans.back().push_back(u);
ans.push_back(vector<int>(4*n,u));
}
vector<vector<int>> create_map(int N, int m, vector<int> a, vector<int> b)
{
n=N;
ans.clear();
for (int i=1;i<=n;i++) nei[i].clear(), vis[i]=0;
for (int i=0;i<m;i++)
nei[a[i]].push_back(b[i]), nei[b[i]].push_back(a[i]);
dfs(1);
return ans;
}
