#include "advisor.h"
#include <bits/stdc++.h>
using namespace std;
void ComputeAdvice(int *C, int N, int K, int M) {
for(int i = 0; i < N; i++){
for(int bit = 12; bit >= 0; bit--){
WriteAdvice((C[i] >> bit & 1));
}
}
}
#include "assistant.h"
#include <bits/stdc++.h>
using namespace std;
void print(int x){
cout << "printed " << x << '\n';
}
void Assist(unsigned char *A, int N, int K, int R) {
vector < int > g[N];
set < pair < int, int > > st;
int id = 0, a[N] = {}, c[N] = {}, val[N] = {}, pos[N] = {};
for(int i = 0; i < N; i++)
for(int bit = 12; bit >= 0; bit--)
a[i] |= (A[id++] << bit);
for(int i = 0; i < N; i++) g[a[i]].push_back(i);
for(int i = 0; i < N; i++) g[i].push_back(N), reverse(g[i].begin(), g[i].end());
for(int i = 0; i < K; i++) c[i] = 1, pos[i] = i, val[i] = i, st.insert({g[val[i]].back(), i});
for(int i = 0; i < N; i++){
if(i) g[a[i - 1]].pop_back();
GetRequest();
bool skip = 0;
for(int x = 0; x < K; x++)
if(val[x] == a[i])
skip = 1;
if(skip) continue;
int y = 0;
for(int x = 0; x < K; x++)
if(g[val[x]].back() > g[val[y]].back())
y = x;
PutBack(val[y]);
val[y] = a[i];
}
}
