#include <bits/stdc++.h>
#include "hall.h"
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)
using namespace std;

int solve(int n, int K, int s) {
    // s
    int now = 0, mn = 0, mnid = -1;
    rep(i, 0, n - 1) {
        if (s >> i & 1) ++now;
        else --now;
        if (now <= mn) mn = now, mnid = i;
    }
    s ^= (1 << (mnid + 1));
    return s;
}