#define DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}
// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
public:
template<typename T>
_Debug& operator,(T val) {
cout << val << endl;
return *this;
}
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif
// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back
// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;
// ---------- END OF TEMPLATE ----------
#include "koala.h"
int B[100],R[100];
int minValue(int N,int W) {
int i;
for (i = 0; i < N; i++) B[i] = 0;
B[0] = 1;
playRound(B,R);
for (i = 0; i < N; i++) {
if (R[i] == 0) return i;
}
return 0;
}
int maxValue(int N,int W) {
int i;
for (i = 0; i < N; i++) B[i] = 1;
playRound(B,R);
for (i = 0; i < N; i++) {
if (R[i] == 2) B[i] = 2;
else B[i] = 0;
}
playRound(B,R);
for (i = 0; i < N; i++) {
if (R[i] == 3) B[i] = 4;
else B[i] = 0;
}
playRound(B,R);
for (i = 0; i < N; i++) {
if (R[i] == 5) B[i] = 11;
else B[i] = 0;
}
playRound(B,R);
for (i = 0; i < N; i++) {
if (R[i] == 12) return i;
}
}
int compare(int a,int b,int N,int W) {
int i;
if (W == 2*N) {
for (i = 0; i < N; i++) B[i] = 0;
B[a] = B[b] = N;
playRound(B,R);
return R[a] < R[b];
}
for (i = 0; i < N; i++) B[i] = 0;
B[a] = B[b] = 6;
playRound(B,R);
if ((R[a] > 0) != (R[b] > 0)) return R[b] > 0;
else if ((R[a] == 0) && (R[b] == 0)) {
for (i = 0; i < N; i++) B[i] = 0;
B[a] = B[b] = 3;
playRound(B,R);
if ((R[a] > 0) != (R[b] > 0)) return R[b] > 0;
for (i = 0; i < N; i++) B[i] = 0;
B[a] = B[b] = 1;
playRound(B,R);
return R[b] > 0;
}
else {
for (i = 0; i < N; i++) B[i] = 0;
B[a] = B[b] = 8;
playRound(B,R);
return R[b] > 0;
}
}
int greaterValue(int N,int W) {
return compare(0,1,N,W);
}
int n,w;
int inv[100],temp[100];
int mergesort(int *arr,int l,int r) {
if (l == r) return 0;
int m = (l+r) / 2;
mergesort(arr,l,m),mergesort(arr,m+1,r);
int i = l,j = m+1,k = 0;
while ((i <= m) || (j <= r)) {
if (i > m) temp[k++] = arr[j++];
else if (j > r) temp[k++] = arr[i++];
else if (compare(arr[i],arr[j],n,w)) temp[k++] = arr[i++];
else temp[k++] = arr[j++];
}
for (i = 0; i < k; i++) arr[l+i] = temp[i];
return 0;
}
void allValues(int N,int W,int *P) {
n = N,w = W;
int i;
for (i = 0; i < N; i++) inv[i] = i;
random_shuffle(inv,inv+N);
mergesort(inv,0,N-1);
for (i = 0; i < N; i++) P[inv[i]] = i+1;
}
