#include "koala.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define ull unsigned long long
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<long long, long long>
#define vi vector<int>
#define vl vector<long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define siz(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
//mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll los(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;
int minValue(int N, int W)
{
int q[N];
rep(i,N) q[i] = 0;
q[0] = 1;
int ans[N];
playRound(q,ans);
rep(i,N)
{
if(ans[i] <= q[i]) return i;
}
}
int solve(int n, vi p)
{
if(siz(p) == 1) return p[0];
int k = 0;
rep2(kk,1,n)
{
if(siz(p)*kk > n) break;
int s1 = (n-siz(p))*(n-siz(p)+1)/2;
int s2 = 0;
rep2(i,n-siz(p)+1,n)
{
if(kk*(i-(n-siz(p))+1) <= n)
{
s2 = max(s2,i*(i+1)/2);
}
}
if(s2 > s1)
{
k = kk;
}
}
int q[n];
int ans[n];
rep(i,n) q[i] = 0;
forall(it,p) q[it] = k;
playRound(q,ans);
vi p2;
forall(it,p) if(ans[it] > q[it]) p2.pb(it);
return solve(n,p2);
}
int maxValue(int N, int W)
{
vi p;
rep(i,N) p.pb(i);
return solve(N,p);
}
int solve2(vi p, int l, int r, int a, int b, int n)
{
vi rest;
rep(i,n) if(i < l-1 || i > r-1) rest.pb(i+1);
sort(all(rest));
reverse(all(rest));
pii k = {0,0};
rep2(kk,1,n)
{
if(kk*(r-l+1) > n) break;
int s2 = n*(n+1)/2-(r*(r+1)/2-l*(l-1)/2);
pair<int,pair<int,pii>> best = {s2,{-n+(r-l+1),{1e9,0}}};
rep2(i,l,r)
{
int s1 = r*(r+1)/2-i*(i-1)/2;
int zost = n-(r-i+1)*(kk+1);
// cout << zost << " zost\n";
if(zost < 0) continue;
int siz_ = zost+(r-i+1);
rep(i,min(zost,siz(rest))) s1 += rest[i];
best = max(best,{s1,{-siz_,{-abs(i-(l+r)/2),i}}});
// cout << s2 << " " << s1 << " " << -siz_ << " " << -abs(i-(l+r)/2) << " " << i <<" i\n";
}
int min_seg = min(best.ss.ss.ss-l,r-best.ss.ss.ss+1);
// cout << kk << " " << min_seg << " " << best.ss.ss.ss << " min\n";
if(best.ff > s2) k = max(k,{min_seg,kk});
}
int d = k.ss;
int q[n];
int ans[n];
rep(i,n) q[i] = 0;
forall(it,p) q[it] = d;
//rep(i,n) cout << q[i];
// cout << " query\n";
playRound(q,ans);
bool p1 = ans[a] > q[a];
bool p2 = ans[b] > q[b];
if(p1 != p2)
{
if(p1 == 1) return 0;
return 1;
}
int cnt = 0;
forall(it,p) if(ans[it] > q[it]) cnt++;
if(p1 == 0)
{
vi p3;
forall(it,p) if(ans[it] <= q[it]) p3.pb(it);
return solve2(p3,l,r-cnt,a,b,n);
}
vi p3;
forall(it,p) if(ans[it] > q[it]) p3.pb(it);
return solve2(p3,l+(siz(p)-cnt),r,a,b,n);
}
int greaterValue(int N, int W)
{
vi p;
rep(i,N) p.pb(i);
return !solve2(p,1,N,0,1,N);
}
int n;
bool comp(int a, int b)
{
int q[n];
int ans[n];
rep(i,n) q[i] = 0;
q[a] = n;
q[b] = n;
playRound(q,ans);
if(ans[a] > n) return 0;
return 1;
}
vi merge_sort(vi p)
{
if(siz(p) == 1) return p;
vi l;
vi r;
rep(i,siz(p)/2) l.pb(p[i]);
rep2(i,siz(p)/2,siz(p)-1) r.pb(p[i]);
l = merge_sort(l);
r = merge_sort(r);
vi ans;
int cur_l = 0;
int cur_r = 0;
while(cur_l < siz(l) || cur_r < siz(r))
{
if(cur_l == siz(l)) ans.pb(r[cur_r++]);
else if(cur_r == siz(r)) ans.pb(l[cur_l++]);
else
{
if(comp(l[cur_l],r[cur_r])) ans.pb(l[cur_l++]);
else ans.pb(r[cur_r++]);
}
}
return ans;
}
void allValues(int N, int W, int *P) {
n = N;
if (W == 2*N) {
vi p;
rep(i,N) p.pb(i);
p = merge_sort(p);
rep(i,N)
{
P[p[i]] = i+1;
}
} else {
// TODO: Implement Subtask 5 solution here.
// You may leave this block unmodified if you are not attempting this
// subtask.
}
}
