#include <bits/stdc++.h>
#define FAST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);cerr.tie(0)
#define mp make_pair
#define xx first
#define yy second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define all(x) x.begin(),x.end()
#define ff(i,a,b) for (int i = a; i < b; i++)
#define fff(i,a,b) for (int i = a; i <= b; i++)
#define bff(i,a,b) for (int i = b-1; i >= a; i--)
#define bfff(i,a,b) for (int i = b; i >= a; i--)
using namespace std;
long double typedef ld;
unsigned int typedef ui;
long long int typedef li;
pair<int,int> typedef pii;
pair<li,li> typedef pli;
pair<ld,ld> typedef pld;
vector<vector<int>> typedef graph;
unsigned long long int typedef ull;
//const int mod = 998244353;
const int mod = 1000000007;
//Note to self: Check for overflow
#include "swaps.h"
bool komp[503][503]; //less
struct bogosort
{
bool operator() (int a, int b)
{
return komp[a][b];
}
};
void solve(int n, int allowed_visits)
{
if (allowed_visits<n)
{
answer({0,0,0,0});
return;
}
fff(d,1,n-1)
{
vector<bool> tvis(n,0);
vector<int> koji;
fff(i,1,n-d) if (!tvis[i]) schedule(i,i+d),tvis[i+d]=1,koji.pb(i);
vector<int> v=visit();
ff(i,0,(int)v.size()) if (v[i]) komp[koji[i]][koji[i]+d]=1;
else komp[koji[i]+d][koji[i]]=1;
bool ok=false;
koji.clear();
fff(i,1,n-d) if (tvis[i]) schedule(i,i+d),ok=true,koji.pb(i);
if (ok)
{
v=visit();
ff(i,0,(int)v.size()) if (v[i]) komp[koji[i]][koji[i]+d]=1;
else komp[koji[i]+d][koji[i]]=1;
}
}
vector<int> ans;
fff(i,1,n) ans.pb(i);
sort(all(ans),bogosort());
answer(ans);
}
