#ifndef rtgsp
#include "koala.h"
#endif // rtgsp
#include<bits/stdc++.h>
#define ll long long
#define task ""
using namespace std;
const int maxn = 1e6 + 2;
#ifdef rtgsp
static int N, W;
static int P[105];
static int maxQueries = 3200;
static int numQueries;
void playRound(int *B, int *R) {
int i, j;
int S = 0;
for (i=0;i<N;++i) {
if ( !(B[i] >= 0 && B[i] <= W) ) {
printf("Invalid query.\n");
exit(0);
}
S += B[i];
}
if (S > W) {
printf("Invalid query.\n");
exit(0);
}
numQueries++;
if (numQueries > maxQueries) {
printf("Too many queries.\n");
exit(0);
}
int cache[2][205];
int num[2][205];
char taken[105][205];
for (i=0;i<205;++i) {
cache[1][i] = 0;
num[1][i] = 0;
}
for (i=0;i<N;++i) {
int v = B[i]+1;
int ii = i&1;
int o = ii^1;
for (j=0;j<=W;++j) {
cache[ii][j] = cache[o][j];
num[ii][j] = num[o][j];
taken[i][j] = 0;
}
for (j=W;j>=v;--j) {
int h = cache[o][j-v] + P[i];
int hn = num[o][j-v] + 1;
if (h > cache[ii][j] || (h == cache[ii][j] && hn > num[ii][j])) {
cache[ii][j] = h;
num[ii][j] = hn;
taken[i][j] = 1;
} else {
taken[i][j] = 0;
}
}
}
int cur = W;
for (i=N-1;i>=0;--i) {
R[i] = taken[i][cur] ? (B[i] + 1) : 0;
cur -= R[i];
}
}
#endif //rtgsp
int B[maxn], R[maxn];
int minValue (int N, int W)
{
for (int i = 0; i < N; i++) B[i] = 0;
B[0] = 1;
playRound(B, R);
for (int i = 0; i < N; i++)
{
if (R[i] == 0) return i;
}
return 0;
}
int maxValue (int N, int W)
{
vector<int> cands, nxt;
for (int i = 0; i < N; i++) cands.push_back(i);
for (int j = 0; j < 4; j++)
{
if ((int)cands.size() == 1) break;
for (int i = 0; i < N; i++) B[i] = 0;
for (int i : cands) B[i] = 100/(int)cands.size();
playRound(B, R);
nxt.clear();
for (int i : cands)
{
if (R[i] > B[i]) nxt.push_back(i);
}
cands = nxt;
}
return cands[0];
}
int greaterValue (int N, int W)
{
for (int i = 0; i < N; i++) B[i] = 0;
int comp[5] = {1, 2, 3, 5, 8}, l = 0, r = 4;
while (l <= r)
{
int m = (l + r)/2;
B[0] = B[1] = comp[m];
playRound(B, R);
if (R[0] > comp[m] && R[1] > comp[m]) l = m + 1;
else if (R[0] <= comp[m] && R[1] <= comp[m]) r = m - 1;
else return R[0] < R[1];
}
return R[0] < R[1];
}
int id[maxn], id2[maxn];
bool cmp (int x, int y)
{
for (int i = 0; i < N; i++) B[i] = 0;
B[x] = B[y] = 100;
playRound(B, R);
return R[y] > 100;
}
void merge_sort (int l, int r)
{
if (l == r) return;
int m = (l + r)/2;
merge_sort(l, m);
merge_sort(m + 1, r);
int x = l, y = m + 1, cur = l;
while (x <= m || y <= r)
{
if (x > m)
{
id2[cur++] = id[y++];
}
else if (y > r)
{
id2[cur++] = id[x++];
}
else
{
if (cmp(id[x], id[y])) id2[cur++] = id[x++];
else id2[cur++] = id[y++];
}
}
for (int i = l; i <= r; i++) id[i] = id2[i];
}
void allValues (int N, int W, int* P)
{
if (W == 200)
{
for (int i = 0; i < N; i++) id[i] = i;
merge_sort(0, N - 1);
for (int i = 0; i < N; i++) P[id[i]] = i + 1;
}
}
#ifdef rtgsp
mt19937_64 rd(0);
static void runGame(int F) {
int i;
N = 100;
W = ((F == 4) ? 200 : 100);
for (i=0;i<N;++i) {
P[i] = i+1;
}
shuffle(P, P + N, rd);
for (i=0;i<N;++i) {
cout << P[i] << " ";
}
cout << '\n';
numQueries = 0;
if (F == 1) {
printf("%d\n", minValue(N, W));
} else if (F == 2) {
printf("%d\n", maxValue(N, W));
} else if (F == 3) {
printf("%d\n", greaterValue(N, W));
} else if (F == 4) {
int userP[105];
allValues(N, W, userP);
for (i=0;i<N;i++) {
printf("%d ",userP[i]);
}
printf("\n");
}
printf("Made %d calls to playRound.\n", numQueries);
}
static void grader() {
int i;
int F, G;
scanf("%d %d",&F,&G);
for (i=0;i<G;i++) {
runGame(F);
}
}
int main() {
grader();
return 0;
}
#endif // rtgsp
