#include "advisor.h"
#include<bits/stdc++.h>
using namespace std;
int c[100050],curr[100050];
deque<int> ap[100050];
priority_queue<pair<int,int>> pq;
void ComputeAdvice(int *C, int n, int k, int m) {
for (int i=0;i<n;i++) c[i]=C[i];
for (int i=0;i<n;i++) ap[c[i]].push_back(i);
for (int i=0;i<n;i++) ap[i].push_back(2e9);
for (int i=0;i<k;i++) curr[i]=i,pq.push({ap[i][0],i});
for (int i=k;i<n;i++) curr[i]=-1;
for (int i=0;i<n;i++){
int choice;
if (curr[c[i]]!=-1){
choice=131071;
}else{
choice=curr[c[i]]=curr[pq.top().second];
curr[pq.top().second]=-1;
pq.pop();
}
while (ap[c[i]].front()<=i) ap[c[i]].pop_front();
pq.push({ap[c[i]].front(),c[i]});
for (int j=0;j<17;j++) WriteAdvice((choice>>j)&1);
}
}
#include "assistant.h"
#include<bits/stdc++.h>
int pos[100050];
void Assist(unsigned char *A, int n, int k, int R) {
for (int i=0;i<k;i++) pos[i]=i;
for (int i=k;i<n;i++) pos[i]=-1;
for (int i=0;i<n;i++){
int nxt=GetRequest();
int choice=0;
for (int j=0;j<17;j++) choice+=A[i*17+j]<<j;
if (choice==131071){
}else{
PutBack(pos[choice]);
pos[choice]=nxt;
}
}
}
