#include<bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define pb push_back
#define ppb pop_back
#define ff first
#define ss second
// vector<int>G[42];
void f(vector<vector<int>> &ans, int cur, int mx, int curRow){
if(cur == mx) return;
int other = (cur == 1 ? 2 : 1);
for(int i = 0;i<ans.size();++i){
if(i % 2 == 0) ans[curRow][i] = cur;
else{
ans[curRow][i] = other;
other++;
if(other == cur) other++;
}
if(other == mx) break;
}
f(ans, cur + 1, mx, curRow + 1);
}
vector<vector<int>> create_map(int N, int M, vector<int> A, vector<int> B){
// for(int i = 0;i<m;++i){
// G[A[i]].pb(B[i]);
// G[B[i]].pb(A[i]);
// }
vector<vector<int>> ans(100, vector<int> (100, 0));
f(ans, 1, N+1, 0);
for(int i = 0;i<ans.size();++i){
for(int j = 0;j<ans.size();++j){
if(ans[i][j] == 0) ans[i][j] = 1;
}
}
return ans;
}
// int main(){
// vector<vector<int>> ans = create_map(3, 4, {1, 2}, {2, 3});
// for(int i = 0;i<ans.size();++i){
// for(int j = 0;j<ans.size();++j){
// cout<<ans[i][j]<<" ";
// }
// cout<<endl;
// }
// }
