#include "advisor.h"
#include <bits/stdc++.h>
using namespace std;
void ComputeAdvice(int *C, int N, int K, int M) {
set<int> S; set<pair<int,int>> SS;
vector<int> v[N+1]; int pos[N+1];
for(int i = 0; i < N; i++) v[C[i]].push_back(i);
for(int i = 0; i < N; i++) v[i].push_back(N+1);
for(int i = 0; i < K; i++){
int nx = *upper_bound(begin(v[i]),end(v[i]),-1);
S.insert(i); SS.insert({nx,i}); pos[i]=i+1;
}
for(int i = 0; i < N; i++) {
int req = C[i];
if(S.count(req)){
int nx = *upper_bound(begin(v[req]),end(v[req]),i);
SS.erase({i,req}); SS.insert({nx,req});
for(int j = 0; j < 15; j++) WriteAdvice(0);
}
int getCol = (--end(SS))->second; pos[req] = pos[getCol];
for(int j = 0; j < 15; j++) WriteAdvice((pos[getCol]>>j)&1);
S.erase(getCol); S.insert(req);
int nx = *upper_bound(begin(v[req]),end(v[req]),i);
SS.erase(--end(SS)); SS.insert({nx,req});
}
}
#include "assistant.h"
#include <bits/stdc++.h>
using namespace std;
void Assist(unsigned char *A, int N, int K, int R) {
int a[K+1]; for(int i = 0; i < K; i++) a[i] = i+1;
for(int i = 0; i < N; i++){
int req = GetRequest();
int p = 0; for(int j = 0; j < 15; j++) if(A[15*i+j]) p|=(1<<j);
if(p) PutBack(a[p]), a[p]=req;
}
}
