#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)
template<typename T>
void amin(T &a, T b) {
a = min(a,b);
}
template<typename T>
void amax(T &a, T b) {
a = max(a,b);
}
#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif
/*
*/
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
#include "advisor.h"
void ComputeAdvice(int *a, int n, int k, int m) {
// WriteAdvice(0);
// WriteAdvice(1);
// WriteAdvice(2);
int B = 0;
while((1<<B) <= k) B++;
queue<int> q[n];
rep(i,n) q[a[i]].push(i);
rep(i,n) q[i].push(inf1);
set<array<int,3>> st;
vector<int> pos(n,-1);
rep(i,k){
st.insert({q[i].front(),i,i});
pos[i] = i;
}
rep(i,n){
int c = a[i];
q[c].pop();
int p = -1;
if(pos[c] != -1){
st.erase({i,c,pos[c]});
st.insert({q[c].front(),c,pos[c]});
}
else{
auto ar = *st.rbegin();
st.erase(ar);
p = pos[c] = pos[ar[1]];
pos[ar[1]] = -1;
st.insert({q[c].front(),c,pos[c]});
}
// write p+1
p++;
rep(bit,B){
int f = 1<<(B-bit-1);
int b = 0;
if(p&f) b = 1;
WriteAdvice(b);
}
}
}
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)
template<typename T>
void amin(T &a, T b) {
a = min(a,b);
}
template<typename T>
void amax(T &a, T b) {
a = max(a,b);
}
#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif
/*
*/
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
#include "assistant.h"
void Assist(unsigned char *a, int n, int k, int m) {
// int i;
// for (i = 0; i < N; i++) {
// int req = GetRequest();
// if (req >= K)
// PutBack(req % K);
// }
int B = 0;
while((1<<B) <= k) B++;
vector<int> curr(k);
rep(i,k) curr[i] = i;
int ptr = 0;
rep(i,n){
int c = GetRequest();
int p = 0;
rep(iter,B){
int b = a[ptr++];
p = (p<<1)|b;
}
p--;
if(p != -1){
PutBack(curr[p]);
curr[p] = c;
}
}
}
