#include <bits/stdc++.h>
#include "worldmap.h"
using namespace std;
const int N = 41;
int n, m, vis[N];
vector<int> g[N], vec;
vector<vector<int>> ans;
void dfs(int v){
vis[v] = 1;
vec.clear();
for (int u : g[v]){
vec.push_back(v);
vec.push_back(u);
}
while (vec.size() < 4 * n - 2)
vec.push_back(v);
ans.push_back(vec);
vec.resize(4 * n - 2, v);
ans.push_back(vec);
for (int u : g[v]){
if (!vis[u]){
vec.resize(4 * n - 2, u);
ans.push_back(vec);
dfs(u);
vec.resize(4 * n - 2, v);
ans.push_back(vec);
continue;
}
}
}
vector<vector<int>> create_map(int nn, int mm, vector<int> a, vector<int> b) {
n = nn, m = mm;
for (int i = 0; i < m; i ++){
g[a[i]].push_back(b[i]);
g[b[i]].push_back(a[i]);
}
dfs(1);
vec.resize(4 * n - 2, 1);
while (ans.size() < 4 * n - 2)
ans.push_back(vec);
memset(vis, 0, sizeof vis);
for (int i = 0; i <= n; i ++)
g[i].clear();
vector<vector<int>> output;
output = ans;
ans.clear();
return output;
}
