#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T L, T R) { while (L != R) cerr << *L << " \n"[next(L) == R], ++L; }
#else
#define DE(...) 0
#define debug(...) 0
#endif
const int MAX_N = 300010;
#include "advisor.h"
int nxt[MAX_N];
struct cmp {
bool operator()(int a, int b) const{
return nxt[a] < nxt[b];
}
};
// pos of color need
vector<int> pos[MAX_N];
set<int, cmp> st;
bool suc[MAX_N], need[MAX_N];
void pushin(int id) {
st.insert(id);
}
void kill(int id) {
st.erase(id);
}
void popoff() {
st.erase(prev(end(st)));
}
bool kp[MAX_N + MAX_N];
void ComputeAdvice(int *C, int N, int K, int M) {
for (int i = 0;i < N;++i) pos[i].pb(N+i);
for (int i = N-1;i >= 0;--i)
pos[ C[i] ].pb(i);
for (int i = 0;i < N;++i)
nxt[i] = pos[i].back();
for (int i = 0;i < K;++i)
pushin(i);
for (int i = 0;i < N;++i) {
if (suc[i] = st.count(C[i]))
kill(C[i]);
else
popoff();
pos[ C[i] ].pop_back();
nxt[ C[i] ] = pos[ C[i] ].back();
pushin(C[i]);
DE(i, C[i], suc[i]);
}
for (int i = N-1;i >= 0;--i) {
DE(i+K, i, C[i], need[C[i]]);
kp[i + K] = need[C[i]];
need[C[i]] = suc[i];
}
for (int i = K-1;i >= 0;--i)
kp[i] = need[i];
for (int i = 0;i < N + K;++i) {
DE(i, kp[i]);
WriteAdvice(kp[i]);
}
}
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
namespace {
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a && (a = b, true); }
template<class T> bool chmax(T &a, T b) { return a < b && (a = b, true); }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T L, T R) { while (L != R) cerr << *L << " \n"[next(L) == R], ++L; }
#else
#define DE(...) 0
#define debug(...) 0
#endif
const int MAX_N = 300010;
}
#include "assistant.h"
int have[MAX_N];
void popoff(int id) {
assert(have[id]);
have[id] = false;
PutBack(id);
}
void Assist(unsigned char *A, int N, int K, int R) {
for (int i = 0;i < N + K;++i)
DE((int)A[i]);
vector<int> gar;
for (int i = 0;i < K;++i) {
have[i] = true;
if (A[i] == 0) gar.pb(i);
}
DE(gar.size());
debug(AI(gar));
for (int i = 0;i < N;++i) {
DE(i);
debug(AI(gar));
int req = GetRequest();
DE(i, have[req]);
if (!have[req]) {
assert(gar.size());
popoff(gar.back()); gar.pop_back();
}
have[req] = true;
if (A[i + K] == 0) gar.pb(req);
}
}
