#ifndef hwe
#include "advisor.h"
#endif
#include <bits/stdc++.h>
using namespace std;
#define popcount(n) (__builtin_popcountll((n)))
#define clz(n) (__builtin_clzll((n)))
#define ctz(n) (__builtin_ctzll((n)))
#define lg(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))
#define Int __int128
#define fi first
#define se second
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;
template <class T1, class T2>
bool maximize(T1 &x, T2 y) {
if (x < y) {
x = y;
return true;
}
return false;
}
template <class T1, class T2>
bool minimize(T1 &x, T2 y) {
if (x > y) {
x = y;
return true;
}
return false;
}
template <class T>
void remove_duplicate(vector<T> &ve) {
sort (ve.begin(), ve.end());
ve.resize(unique(ve.begin(), ve.end()) - ve.begin());
}
const int N = 1e5 + 5;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;
#ifdef hwe
string advice;
void WriteAdvice(int b) {
advice += char(b + 48);
// cerr << "Write: " << b << '\n';
}
#endif
void ComputeAdvice(int *C, int n, int k, int m) {
vector<int> pos(n, n), nxt(n, 0);
for (int i = n - 1; i >= 0; --i) {
nxt[i] = pos[C[i]], pos[C[i]] = i;
}
set<pii> s;
string advice(n + k, '0');
for (int i = 0; i < k; ++i) {
s.emplace(pos[i], i);
pos[i] = i;
}
for (int i = 0; i < n; ++i) {
auto it = s.find(make_pair(i, C[i]));
if (it != s.end()) {
s.erase(it);
advice[pos[C[i]]] = '1';
}
else {
auto [p, x] = *s.rbegin(); s.erase(s.find(make_pair(p, x)));
advice[pos[x]] = '0';
}
s.emplace(nxt[i], C[i]);
pos[C[i]] = k + i;
}
for (auto [p, x] : s) advice[pos[x]] = '0';
for (auto c : advice) WriteAdvice(c - '0');
}
// void ComputeAdvice(int *C, int N, int K, int M) {
// WriteAdvice(0);
// WriteAdvice(1);
// }
#ifdef hwe
int C[N], n, k;
signed main() {
cin >> n >> k;
for (int i = 0; i < n; ++i) cin >> C[i];
ComputeAdvice(C, n, k, 0);
cerr << "Advice: " << advice << '\n';
return 0;
}
#endif
#ifndef hwe
#include "assistant.h"
#endif
#include <bits/stdc++.h>
using namespace std;
#define popcount(n) (__builtin_popcountll((n)))
#define clz(n) (__builtin_clzll((n)))
#define ctz(n) (__builtin_ctzll((n)))
#define lg(n) (63 - __builtin_clzll((n)))
#define BIT(n, i) (((n) >> (i)) & 1ll)
#define MASK(i) (1ll << (i))
#define FLIP(n, i) ((n) ^ (1ll << (i)))
#define ON(n, i) ((n) | MASK(i))
#define OFF(n, i) ((n) & ~MASK(i))
#define Int __int128
#define fi first
#define se second
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef pair<long long, int> pli;
typedef pair<int, long long> pil;
typedef vector<pair<int, int>> vii;
typedef vector<pair<long long, long long>> vll;
typedef vector<pair<long long, int>> vli;
typedef vector<pair<int, long long>> vil;
template <class T1, class T2>
bool maximize(T1 &x, T2 y) {
if (x < y) {
x = y;
return true;
}
return false;
}
template <class T1, class T2>
bool minimize(T1 &x, T2 y) {
if (x > y) {
x = y;
return true;
}
return false;
}
template <class T>
void remove_duplicate(vector<T> &ve) {
sort (ve.begin(), ve.end());
ve.resize(unique(ve.begin(), ve.end()) - ve.begin());
}
const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
const int inf = 1e9;
const ll INF = 1e18;
#ifdef hwe
int C[N], n, k, pos = 0;
unsigned char A[N];
string advice;
void WriteAdvice(int b) {
advice += char(b + 48);
// cerr << "Write: " << b << '\n';
}
void ComputeAdvice(int *C, int n, int k, int m) {
vector<int> pos(n, n), nxt(n, 0);
for (int i = n - 1; i >= 0; --i) {
nxt[i] = pos[C[i]], pos[C[i]] = i;
}
set<pii> s;
string advice(n + k, '0');
for (int i = 0; i < k; ++i) {
s.emplace(pos[i], i);
pos[i] = i;
}
for (int i = 0; i < n; ++i) {
auto it = s.find(make_pair(i, C[i]));
if (it != s.end()) {
s.erase(it);
advice[pos[C[i]]] = '1';
}
else {
auto [p, x] = *s.rbegin(); s.erase(s.find(make_pair(p, x)));
advice[pos[x]] = '0';
}
s.emplace(nxt[i], C[i]);
pos[C[i]] = k + i;
}
for (auto [p, x] : s) advice[pos[x]] = '0';
for (auto c : advice) WriteAdvice(c - '0');
}
int GetRequest() {
return C[pos++];
}
void PutBack(int c) {
// cerr << "putback " << c << '\n';
}
#endif
// void Assist(unsigned char *A, int N, int K, int R) {
// int i;
// for (i = 0; i < N; i++) {
// int req = GetRequest();
// if (req >= K)
// PutBack(req % K);
// }
// }
void Assist(unsigned char *A, int n, int k, int r) {
vector<int> active(n, false), passive;
for (int i = 0; i < k; ++i) {
active[i] = A[i] - '0';
if (!active[i]) passive.emplace_back(i);
}
for (int i = 0; i < n; ++i) {
int c = GetRequest();
// cerr << "req " << c << '\n';
if (active[c]) {
active[c] = A[k + i] - '0';
if (!active[c]) passive.emplace_back(c);
}
else {
if (passive.empty()) {
return;
}
assert(!passive.empty());
int x = passive.back(); passive.pop_back();
PutBack(x);
active[c] = A[k + i] - '0';
if (!active[c]) passive.emplace_back(c);
}
}
}
#ifdef hwe
mt19937_64 rng(2);
ll random(ll l, ll r) {
return uniform_int_distribution<ll>(l, r)(rng);
}
signed main() {
ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
while (true) {
n = random(5, 5000), k = random(1, n - 1);
for (int i = 0; i < n; ++i) C[i] = random(0, n - 1);
pos = 0, advice = "";
ComputeAdvice(C, n, k, 0);
// cerr << "advice " << advice << '\n';
// if (advice == "01111000") {
// cerr << n << ' ' << k << '\n';
// for (int i = 0; i < n; ++i) cerr << C[i] << ' ';
// cerr << '\n';
// }
for (int i = 0; i < (int)advice.size(); ++i) A[i] = advice[i];
Assist(A, n, k, advice.size());
}
return 0;
}
#endif
