#include "advisor.h"
#include <bits/stdc++.h>
#ifndef EVAL
#include "grader.cpp"
#endif
using namespace std;
#define lol long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scanl(a) scanf("%lld",&a);
#define scanll(a,b) scanf("%lld %lld",&a, &b);
#define scanlll(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define scan1(a) scanf("%d",&a);
#define scan2(a,b) scanf("%d %d",&a, &b);
#define scan3(a,b,c) scanf("%d %d %d",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
#define eps 1e-12
int vis[100001],predok[100001],is[100001],INF = 1e9+7;
void ComputeAdvice(int *c, int N, int K, int M) {
int i,n = log2(N),j;
set <pii> q;
for (i=0;i<N;++i){
vis[i] = INF;
}
for (i=N-1;i>=0;--i){
predok[i] = vis[c[i]];
vis[c[i]] = i;
}
for (i=0;i<K;++i){
q.insert({-vis[i],i});
is[i]=1;
}
for (j=0;j<N;++j){
if (is[c[j]]){
int x = c[j];
for (i=0;i<n;++i)WriteAdvice(1);
q.erase({-vis[c[i]],x});
vis[c[j]] = predok[j];
}
else {
int x = q.begin()->sc;
q.erase(q.begin());
is[x] = 0;
for (i=0;i<n;++i){
if ((x&(1<<i)))WriteAdvice(1);
else WriteAdvice(0);
}
is[c[j]]=1;
}
q.insert({-predok[j],c[j]});
}
}
#include "assistant.h"
#include <bits/stdc++.h>
#ifndef EVAL
#include "grader.cpp"
#endif
using namespace std;
#define lol long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scanl(a) scanf("%lld",&a);
#define scanll(a,b) scanf("%lld %lld",&a, &b);
#define scanlll(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define scan1(a) scanf("%d",&a);
#define scan2(a,b) scanf("%d %d",&a, &b);
#define scan3(a,b,c) scanf("%d %d %d",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
#define eps 1e-12
void Assist(unsigned char *A, int N, int K, int R) {
int i,n = log2(N),j,ans;
for (i = 0; i < R; i +=n) {
ans = 0;
for (j = 0;j<n;++j){
int req = A[i+j];
if (req){
ans += (1<<j);
}
}
int req = GetRequest();
if (ans < N)PutBack(ans);
}
}
