#include "koala.h"
#include <bits/stdc++.h>
using namespace std;
const int mxn = 110;
int ask[mxn],res[mxn];
int N,W;
void play(int* a,int* b){
//cerr<<"ASK:"<<endl;for(int i = 0;i<N;i++)cerr<<a[i]<<(i%10 == 9?"\n":" ");cerr<<endl;
playRound(a,b);
//cerr<<"RES:"<<endl;for(int i = 0;i<N;i++)cerr<<b[i]<<(i%10 == 9?"\n":" ");cerr<<endl;
}
namespace S1{
int GO(){
memset(ask,0,sizeof(ask));
ask[0] = 1;
play(ask,res);
if(res[0] == 2){
for(int i = 1;i<N;i++)if(!res[i])return i;
assert(false);
}
else return 0;
memset(ask,0,sizeof(ask));
ask[1] = 1;
play(ask,res);
for(int i = 2;i<N;i++)if(!res[i])return i;
assert(false);
return -1;
}
}
int minValue(int NN, int WW) {
// TODO: Implement Subtask 1 solution here.
// You may leave this function unmodified if you are not attempting this
// subtask.
N = NN,W = WW;
return S1::GO();
}
namespace S2{
int GO(){
for(int i = 0;i<N;i++)ask[i] = 1;
play(ask,res);
int num = N/2;
while(num>1){
int cnt = 0;
for(int i = 0;i<N;i++)if(res[i]==1)res[i] = 0;
int val = N/num;
for(int i = 0;i<N;i++){
if(res[i])res[i] = val;
}
play(res,res);
num = 0;
for(int i = 0;i<N;i++){
num += res[i]>1;
}
}
for(int i = 0;i<N;i++)if(res[i]>=*max_element(res,res+N))return i;
assert(false);
}
}
int maxValue(int NN, int WW) {
// TODO: Implement Subtask 2 solution here.
// You may leave this function unmodified if you are not attempting this
// subtask.
N = NN,W = WW;
return S2::GO();
}
namespace S3{
int GO(){
int l = 1,r = 12;
while(l != r){
int mid = (l+r)>>1;
memset(ask,0,sizeof(ask));
ask[0] = ask[1] = mid;
play(ask,res);
if(res[0]>mid&&res[1]>mid)l = mid+1;
else if(res[0]<=mid&&res[1]<=mid)r = mid-1;
else if(res[0]>mid)return 0;
else if(res[1]>mid)return 1;
}
ask[0] = ask[1] = l;
play(ask,res);
return (res[0]>l?0:1);
}
}
int greaterValue(int NN, int WW) {
// TODO: Implement Subtask 3 solution here.
// You may leave this function unmodified if you are not attempting this
// subtask.
N = NN,W = WW;
return S3::GO();
}
namespace S5{
bool cmp(int a,int b){
int l = 1,r = 12;
while(l != r){
int mid = (l+r)>>1;
memset(ask,0,sizeof(ask));
ask[a] = ask[b] = mid;
play(ask,res);
if(res[a]>mid&&res[b]>mid)l = mid+1;
else if(res[a]<=mid&&res[b]<=mid)r = mid-1;
else if(res[a]>mid)return 0;
else if(res[b]>mid)return 1;
}
memset(ask,0,sizeof(ask));
ask[a] = ask[b] = l;
play(ask,res);
return (res[a]>l?0:1);
}
int arr[mxn];
void GO(int * P){
cerr<<"HI"<<endl;
for(int i = 0;i<N;i++)arr[i] = i;
stable_sort(arr,arr+N,cmp);
for(int i = 0;i<N;i++)cerr<<arr[i]<<' ';cerr<<endl;
for(int i = 0;i<N;i++)P[arr[i]] = i+1;
return;
}
}
void allValues(int NN, int WW, int *P) {
N = NN,W = WW;
if (W == 2*N) {
// TODO: Implement Subtask 4 solution here.
// You may leave this block unmodified if you are not attempting this
// subtask.
} else {
S5::GO(P);
return;
// TODO: Implement Subtask 5 solution here.
// You may leave this block unmodified if you are not attempting this
// subtask.
}
}
