#include "worldmap.h"
#include <vector>
#include <iostream>
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> > G(N);
for (int i = 0; i < M; i++) {
A[i]--;
B[i]--;
G[A[i]].push_back(B[i]);
G[B[i]].push_back(A[i]);
}
vector<bool> vis(N, false);
vector<int> depth(N);
vector<int> tour, RA, RB;
auto dfs = [&](auto& self, int x) -> void {
vis[x] = true;
tour.push_back(x);
for (int i : G[x]) {
if (!vis[i]) {
depth[i] = depth[x] + 1;
self(self, i);
tour.push_back(x);
} else if (depth[x] < depth[i]) {
RA.push_back(x);
RB.push_back(i);
}
}
};
dfs(dfs, 0);
vector<vector<int> > H(N);
for (int i = 0; i < M - (N - 1); i++) {
H[RA[i]].push_back(RB[i]);
}
vector<vector<int> > ans(6 * N - 3, vector<int>(6 * N - 3));
for (int i = 0; i < 6 * N - 3; i++) {
for (int j = 0; j < 6 * N - 3; j++) {
ans[i][j] = tour[j / 3];
}
}
vector<bool> used(N, false);
for (int i = 1; i < 6 * N - 3; i += 3) {
if (!used[ans[0][i]]) {
used[ans[0][i]] = true;
for (int j = 0; j < int(H[ans[0][i]].size()); j++) {
ans[j * 2 + 1][i] = H[ans[0][i]][j];
}
}
}
for (int i = 0; i < int(ans.size()); i++) {
for (int j = 0; j < int(ans.size()); j++) {
ans[i][j]++;
}
}
return ans;
}
