#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<pair<int, int>>> g(N + 1);
for (int i = 0; i < M; ++i) {
g[A[i]].push_back({B[i], i});
g[B[i]].push_back({A[i], i});
}
vector<int> col(N + 1);
vector<int> order;
vector<int> handled(M);
function<void(int, int)> dfs = [&](int u, int p) {
col[u] = 1;
order.push_back(u);
for (auto [v, i] : g[u]) {
if (v == p) continue;
if (col[v]) {
if (handled[i]) continue; // this adjacency is already accounted for
order.push_back(v);
} else {
dfs(v, u);
}
handled[i] = 1;
order.push_back(u);
}
};
dfs(1, 0);
// cerr << "order:\n";
// for (int x : order) {
// cerr << x << " ";
// }
// cerr << "\n";
int L = sz(order);
vector<vector<int>> ans(L, vector<int>(L));
for (int i = 0; i < L; ++i) {
fill(all(ans[i]), order[i]);
}
return ans;
}
