#include "bits/stdc++.h"
// #include "grader.cpp"
#include "worldmap.h"
using namespace std;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i)
#define wr puts("----------------")
#define mm make_pair
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
vector<vector<int>> create_map(int n, int m, vector<int> A, vector<int> B) {
if(n==1){
vector<vector<int>> ans;
ans.pb({1});
return ans;
}
assert(m==n*(n-1)/2);
vector<vector<int>> ans(2*(n-1), vector<int> (2*(n-1)));
for(int i = 0; i < n; ++i){
int cnt=0;
for(int j = 0; j < 2*(n-1); ++j){
if(j%2==0)
ans[i][j]=i+1;
else{
cnt++;
if(cnt==i+1)
cnt++;
ans[i][j]=cnt;
}
}
}
for(int i = 0; i < 2*(n-1); ++i)
for(int j = 0; j < 2*(n-1); ++j)
umax(ans[i][j], 1);
return ans;
}
