#include "worldmap.h"
#include <cassert>
#include <cstdio>
#include <bits/stdc++.h>
using namespace std;
vector<int>j;
const int N1=50;
vector<int>v[N1];
//#include "worldmap.h"
int x[N1];
void dfs(int a,int bati){
x[a]=1;
j.push_back(a);
for (int k:v[a]) {
if(x[k]!=1 && k!=bati) {
dfs(k,a);
j.push_back(a);
}
}
}
vector<vector<int>>create_map(int N, int M,vector<int> A,vector<int> B) {
int n=A.size();
for(int i=0; i<n; i++){
v[A[i]].push_back(B[i]);
v[B[i]].push_back(A[i]);
}
dfs(1,-1);
int batiii=j.size();
vector<vector<int>> ans(batiii, vector<int>(batiii));
for(int i=1; i<j.size()-1; i++){
for(int drnachvi=1; drnachvi<j.size()-1; drnachvi++){
if(j[i]==0){
ans[drnachvi-1][i-1]=ans[drnachvi-1][i-2];
continue;
}
ans[drnachvi-1][i-1]=j[i];
//cout<<ans[drnachvi][i]<<" ";
}
//cout<<endl;
}
return ans;
}
