#include "worldmap.h"
#include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
using namespace std;
std::vector<std::vector<int>> create_map(int N, int M, std::vector<int> A, std::vector<int> B) {
vector<vector<int>> ans(2 * N - 1, vector<int>(2 * N - 1));
if (M != N - 1) return ans;
vector<vector<int>> g(N);
for (int i = 0; i < M; ++i) {
g[A[i]].push_back(B[i]);
g[B[i]].push_back(A[i]);
}
vector<int> order;
function<void(int, int)> dfs = [&](int u, int p) {
order.push_back(u);
for (int v : g[u]) {
if (v == p) continue;
dfs(v, u);
order.push_back(u);
}
};
dfs(1, 0);
assert(sz(order) == 2 * N - 1);
for (int i = 0; i < 2 * N - 1; ++i) {
fill(all(ans[i]), order[i]);
}
return ans;
}
