#include "koala.h"
#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

int n, w;

int B[110], R[110];
inline vector <int> Query(vector <int> qry)
{
    cout << "Query ";
    for (int i = 0; i < n; i++) cout << qry[i] << ' '; cout << '\n';
    for (int i = 0; i < n; i++) B[i] = qry[i];
    playRound(B, R);
    vector <int> ret(n);
    for (int i = 0; i < n; i++) ret[i] = R[i];
    return ret;
}
inline vector <int> GetPos(vector <int> opt, vector <int> ret, int x)
{
    vector <int> pos;
    for (int i = 0; i < n; i++)
        if (opt[i] < ret[i] && opt[i] == x) pos.push_back(i);
    return pos;
}

vector <int> opt(100), ret(100), pos;


int minValue(int N, int W)
{
    n = N, w = W;
    opt[0] = 1, ret = Query(opt);
    if (ret[0] < 2) return 0;
    for (int i = 0; i < n; i++)
        if (!ret[i]) return i;
}

int maxValue(int N, int W)
{
    n = N, w = W;

    for (int i = 0; i < n; i++) opt[i] = 1;
    ret = Query(opt), pos = GetPos(opt, ret, 1);

    for (int i = 0; i < n; i++) opt[i] = 0;
    for (auto x : pos) opt[x] = 2;
    ret = Query(opt), pos = GetPos(opt, ret, 2);
    
    for (int i = 0; i < n; i++) opt[i] = 0;
    for (auto x : pos) opt[x] = 4;
    ret = Query(opt), pos = GetPos(opt, ret, 4);

    for (int i = 0; i < n; i++) opt[i] = 0;
    for (auto x : pos) opt[x] = 11;
    ret = Query(opt), pos = GetPos(opt, ret, 11);

    return pos[0];
}

const int gV[7] = {1, 2, 4, 5, 6, 7, 8};
int greaterValue(int N, int W)
{
    n = N, w = W;
    int l = 0, r = 6, mid;
    while (l <= r)
    {
        mid = l + r >> 1;
        opt[0] = gV[mid], opt[1] = gV[mid];
        ret = Query(opt);
        bool flag = (ret[0] > opt[0]) ^ (ret[1] > opt[1]);
        if (flag) return (ret[1] > opt[1]);
        if (ret[0] > opt[0]) l = mid + 1;
        else r = mid - 1;
    }
    return 0;
}

void allValues(int N, int W, int *P)
{
    n = N, w = W;
    if (W == 2 * N)
    {
        // TODO: Implement Subtask 4 solution here.
        // You may leave this block unmodified if you are not attempting this
        // subtask.
    }
    else
    {
        // TODO: Implement Subtask 5 solution here.
        // You may leave this block unmodified if you are not attempting this
        // subtask.
    }
}