//by szh
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pb push_back
#define debug(x) cerr<<#x<<"="<<x<<endl
#define pq priority_queue
#define inf 0x3f
#define rep(i,a,b) for (int i=a;i<(b);i++)
#define MP make_pair
#define SZ(x) (int(x.size()))
#define ll long long
#define mod 1000000007
#define ALL(x) x.begin(),x.end()
void inc(int &a,int b) {a=(a+b)%mod;}
void dec(int &a,int b) {a=(a-b+mod)%mod;}
int lowbit(int x) {return x&(-x);}
ll p0w(ll base,ll p) {ll ret=1;while(p>0){if (p%2ll==1ll) ret=ret*base%mod;base=base*base%mod;p/=2ll;}return ret;}
#include "swaps.h"
const int maxn = 555;
int grid[maxn][maxn];
bool cmp(int x,int y) {
if (grid[x][y]!=-1) return grid[x][y];
return grid[y][x]^1;
}
void solve(int N, int V) {
// TODO implement this function
memset(grid,-1,sizeof(grid));
rep(i,1,N) {
for (int j=1;j+i<=N;j+=i*2)
rep(k,0,i) if (j+k+i<=N) schedule(j+k,j+k+i);
vector <int> tmp = visit();
reverse(ALL(tmp));
for (int j=1;j+i<=N;j+=i*2)
rep(k,0,i) if (j+k+i<=N) grid[j+k][j+k+i] = tmp.back(), tmp.pop_back();
for (int j=1+i;j+i<=N;j+=i*2)
rep(k,0,i) if (j+k+i<=N) schedule(j+k,j+k+i);
tmp = visit();
reverse(ALL(tmp));
for (int j=1+i;j+i<=N;j+=i*2)
rep(k,0,i) if (j+k+i<=N) grid[j+k][j+k+i] = tmp.back(), tmp.pop_back();
}
vector <int> ret;
rep(i,0,N) ret.pb(i+1);
sort(ALL(ret),cmp);
answer(ret);
return;
}
