#include using namespace std; typedef long long signed int LL; typedef long long unsigned int LU; #define incID(i, l, r) for(int i = (l) ; i < (r); i++) #define incII(i, l, r) for(int i = (l) ; i <= (r); i++) #define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--) #define decII(i, l, r) for(int i = (r) ; i >= (l); i--) #define inc(i, n) incID(i, 0, n) #define inc1(i, n) incII(i, 1, n) #define dec(i, n) decID(i, 0, n) #define dec1(i, n) decII(i, 1, n) #define inII(v, l, r) ((l) <= (v) && (v) <= (r)) #define inID(v, l, r) ((l) <= (v) && (v) < (r)) #define PB push_back #define EB emplace_back #define MP make_pair #define FI first #define SE second #define PQ priority_queue #define ALL(v) v.begin(), v.end() #define RALL(v) v.rbegin(), v.rend() #define FOR(it, v) for(auto it = v.begin(); it != v.end(); ++it) #define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it) template bool setmin(T & a, T b) { if(b < a) { a = b; return true; } else { return false; } } template bool setmax(T & a, T b) { if(b > a) { a = b; return true; } else { return false; } } template bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } } template bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } } template T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); } template T lcm(T a, T b) { return a / gcd(a, b) * b; } // ---- ---- template class SegTree { private: T * a = NULL; int N = -1, S; function F; T I; bool is_available = false; public: SegTree() { } SegTree(int n, function func, T id) { init(n, func, id); } // [0, n) が使用可能になる、func が演算、id は単位元 void init(int size, function func, T id) { assert(size > 0); N = size; F = func; I = id; S = 1; while(S < size) { S *= 2; } delete[] a; a = new T[S * 2]; inc(i, S * 2) { a[i] = I; } is_available = true; } // [p] の値を返す T operator[](int p) { assert(inID(p, 0, N)); p += S; return a[p]; } // [p] への参照を返す(calc() を呼ぶまで fold は使用不能になる) T & ref(int p) { is_available = false; assert(inID(p, 0, N)); p += S; return a[p]; } // テーブル全体を再計算 void calc() { decID(i, 1, S) { a[i] = F(a[i * 2], a[i * 2 + 1]); } is_available = true; } // [p] に op を適用しテーブルを更新 void apply(int p, function op) { assert(inID(p, 0, N)); p += S; op(a[p]); while(p != 1) { p /= 2; a[p] = F(a[p * 2], a[p * 2 + 1]); } } // [l, r) に f を適用した結果を返す T fold_ID(int l, int r, bool loop = false) { assert(is_available); assert(inII(l, 0, N)); assert(inII(r, 0, N)); if(loop && l >= r) { return F(fold_ID(l, N), fold_ID(0, r)); } assert(l <= r); l += S; r += S; T v = I, w = I; while(l < r) { if(l + 1 == r) { v = F(v, a[l]); break; } if(l % 2 == 1) { v = F(v, a[l]); } if(r % 2 == 1) { w = F(a[r - 1], w); } l = (l + 1) / 2; r = r / 2; } return F(v, w); } T fold_II(int l, int r, bool loop = false) { return fold_ID(l, r + 1, loop); } }; #define OP(op) [](auto a, auto b) { return op; } #define AP(op) [](auto & a) { op; } // ---- ---- ---- ---- #define UQns(v) v.erase(unique(ALL(v)), v.end()) #define UQ(v) sort(ALL(v)); UQns(v) LL q, k, t[200000], v[200000]; vector rv; map vr; int main() { cin >> q >> k; inc(i, q) { cin >> t[i]; if(t[i] == 1) { cin >> v[i]; rv.PB(v[i]); } } UQ(rv); inc(i, rv.size()) { vr[rv[i]] = i; } int s = rv.size() + 1; SegTree st(s, OP(a + b), 0); int c = 0; inc(i, q) { if(t[i] == 1) { c++; st.apply(vr[v[i]], AP(a++)); } else { if(c < k) { cout << "-1\n"; } else { int L = 0, H = s; while(H - L > 1) { int M = (L + H) / 2; (st.fold_ID(0, M) < k ? L : H) = M; } cout << rv[L] << "\n"; st.apply(L, AP(a--)); c--; } } } return 0; }