#include "worldmap.h"
#include <bits/stdc++.h>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
std::vector<std::vector<int>> create_map(int N, int M, std::vector<int> A, std::vector<int> B) {
vector<vector<int>> adj(N + 1);
vector<vector<int>> c(N + 1, vector<int>(N + 1));
for (int i = 0; i < M; ++i) {
adj[A[i]].push_back(B[i]);
adj[B[i]].push_back(A[i]);
c[A[i]][B[i]] = c[B[i]][A[i]] = 1;
}
vector<int> ord;
auto dfs = [&](auto& dfs, int v) -> void {
ord.push_back(v);
for (auto& u : adj[v]) {
if (!c[v][u]) continue;
c[v][u] = c[u][v] = 0;
dfs(dfs, u);
ord.push_back(v);
}
};
dfs(dfs, 1);
vector<vector<int>> ret(sz(ord));
for (int i = 0; i < sz(ord); ++i) {
for (int j = 0; j < sz(ord); ++j) {
ret[i].push_back(ord[i]);
}
}
return ret;
}
