#include "worldmap.h"
#include <bits/stdc++.h>
using namespace std;
// #define int long long int
using vi = vector<int>;
using vvi = vector<vi>;
void dfs(int u, vector<bool> &vis, vvi &adj, vi &tour) {
vis[u] = true;
tour.push_back(u);
// sort(adj[u].begin(), adj[u].end(), [&](int a, int b) {return adj[a].size() < adj[b].size();});
for (int v : adj[u]) {
if (vis[v]) continue;
dfs(v, vis, adj, tour);
tour.push_back(u);
}
}
vvi create_map(int n, int m, vi a, vi b) {
vvi adj(n+1, vi()); for (int i = 0; i < m; i++) adj[a[i]].push_back(b[i]), adj[b[i]].push_back(a[i]);
int K = 5 * n;
vector<set<pair<int, int>>> diags(2*K-1);
for (int i = 0; i < K; i++) {
for (int j = 0; j < K; j++) {
int md = i + j;
diags[md].insert({i, j});
}
}
vector<bool> vis(n+1, false); vi tour; set<int> seen;
dfs(1, vis, adj,tour);
set<pair<int, int>> used;
vvi ans(K, vi(K, 1)), dgs(n+1);
int cidx = 0;
for (int i = 0; i < tour.size(); i++) {
dgs[tour[i]].push_back(cidx+1);
dgs[tour[i]].push_back(cidx+3);
for (; cidx < 5 * i + 5; cidx++) {
for (auto &el : diags[cidx]) {
ans[el.first][el.second] = tour[i];
}
}
}
for (int i = 1; i <= n; i++) {
int aidx = 0;
for (auto &gd : dgs[i]) {
for (auto &el : diags[gd]) {
if (aidx >= adj[i].size()) break;
ans[el.first][el.second] = adj[i][aidx++];
}
}
}
return ans;
}
