#include "bits/stdc++.h"
// #include "grader.cpp"
#include "worldmap.h"
using namespace std;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i)
#define wr puts("----------------")
#define mm make_pair
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N = 41;
vector<int> adj[N], back[N];
bool vis[N];
int d[N];
vector<int> v;
void dfs(int x){
vis[x]=1, v.pb(x);
tr(it, adj[x]){
if(!vis[*it]){
d[*it]=d[x]+1;
dfs(*it);
v.pb(x);
}
else if(d[x]<d[*it])
back[x].pb(*it);
}
}
vector<vector<int>> create_map(int n, int m, vector<int> A, vector<int> B) {
vector<vector<int>> ans(4*n-1, vector<int> (4*n-1));
for(int i = 0; i < m; ++i)
adj[A[i]].pb(B[i]), adj[B[i]].pb(A[i]);
dfs(1);
memset(vis, 0, sizeof vis);
int now=0;
for(int i = 0; i < 2*n-1; ++i){
if(!vis[v[i]]){
for(int i_ = 0; i_ < 4*n-1; ++i_)
ans[i_][now]=v[i], ans[i_][now+1]=v[i], ans[i_][now+2]=v[i];
now++;
for(int i_ = 0; i_ < (int)back[v[i]].size(); ++i_)
ans[i_*2+1][now]=back[v[i]][i_];
now+=2;
vis[v[i]]=1;
continue;
}
for(int i_ = 0; i_ < 4*n-1; ++i_)
ans[i_][now]=v[i]; // closing
now++;
}
return ans;
}
