import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } void bAdd(T)(T[] bit, int pos, T val) in { assert(0 <= pos && pos < bit.length, "bAdd: 0 <= pos < |bit| must hold"); } do { for (int x = pos; x < bit.length; x |= x + 1) { bit[x] += val; } } // sum of [0, pos) T bSum(T)(T[] bit, int pos) in { assert(0 <= pos && pos <= bit.length, "bSum: 0 <= pos <= |bit| must hold"); } do { T ret = 0; for (int x = pos - 1; x >= 0; x = (x & (x + 1)) - 1) { ret += bit[x]; } return ret; } // min pos s.t. pred(sum of [0, pos)) // assume pred(sum of [0, pos)) is non-decreasing int bBinarySearch(alias pred, T)(T[] bit) { import core.bitop : bsr; import std.functional : unaryFun; alias predFun = unaryFun!pred; if (predFun(0)) return 0; int pos = 0; T sum = 0; foreach_reverse (e; 0 .. bsr(bit.length) + 1) { const x = (pos | 1 << e) - 1; if (x < bit.length && !predFun(sum + bit[x])) { pos |= 1 << e; sum += bit[x]; } } return pos + 1; } void main() { try { for (; ; ) { const N = readInt; const Q = readInt; auto A = new long[N]; foreach (i; 0 .. N) { A[i] = readLong; } auto O = new int[Q]; auto K = new int[Q]; auto X = new long[Q]; foreach (q; 0 .. Q) { O[q] = readInt; if (O[q] == 1) { K[q] = readInt - 1; X[q] = readLong; } else if (O[q] == 2) { // } else if (O[q] == 3) { K[q] = readInt - 1; } else { assert(false); } } const as = (A ~ X).sort.uniq.array; const asLen = cast(int)(as.length); debug { writeln("as = ", as); } auto bitI = new int[N]; auto bitJ = new int[asLen]; auto js = new int[N]; js[] = -1; int[] que; foreach (i; 0 .. N) { const j = as.lowerBound(A[i]); js[i] = j; que ~= i; } int getJ(int i) { if (~js[i]) { return js[i]; } else { const r = bitI.bSum(i); return bitJ.bBinarySearch!(sum => (sum >= r + 1)) - 1; } } foreach (q; 0 .. Q) { if (O[q] == 1) { const i = K[q]; if (!~js[i]) { const j = getJ(i); bitI.bAdd(i, -1); bitJ.bAdd(j, -1); que ~= i; } js[i] = as.lowerBound(X[q]); } else if (O[q] == 2) { foreach (i; que) { bitI.bAdd(i, +1); bitJ.bAdd(js[i], +1); js[i] = -1; } que = []; } else if (O[q] == 3) { const i = K[q]; const j = getJ(i); writeln(as[j]); } else { assert(false); } } } } catch (EOFException e) { } }