#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>

using namespace std;

const int N = 120000, INF = 1e8;

int n, q;
int root, idx;

struct Node {
    int s[2], v, p;
    int size, cnt;
    
    void init(int _v, int _p) {
        v = _v, p = _p;
        size = 1 ,cnt = 1;
    }
}tr[N];

void pushup(int x) {
    tr[x].size = tr[tr[x].s[1]].size + tr[tr[x].s[0]].size + tr[x].cnt;
}

void rotate(int x) {
    int y = tr[x].p, z = tr[y].p;
    int k = tr[y].s[1] == x;
    tr[z].s[tr[z].s[1] == y] = x, tr[x].p = z;
    tr[y].s[k] = tr[x].s[k ^ 1], tr[tr[x].s[k ^ 1]].p = y;
    tr[x].s[k ^ 1] = y, tr[y].p = x;
    pushup(y), pushup(x);
}

void splay(int x, int k) {
    while(tr[x].p != k) {
        int y = tr[x].p, z = tr[y].p;
        if(z != k) {
            if((tr[y].s[1] == x) ^ (tr[z].s[1] == y)) rotate(x);
            else rotate(y);
        }
        rotate(x);
    }
    if(!k) root = x;
}

void insert(int v) {
    int u = root, p = 0;
    while(u && tr[u].v != v) p = u, u = tr[u].s[v > tr[u].v];
    if(u) tr[u].cnt++;
    else {
        u = ++idx;
        if(p) tr[p].s[v > tr[p].v] = u;
        tr[u].init(v, p);
    }
    splay(u, 0);
}

int get_k(int k) {
    int u = root;
    while(true) {
        if(tr[tr[u].s[0]].size >= k) u = tr[u].s[0];
        else if(tr[tr[u].s[0]].size + tr[u].cnt < k) k -= tr[tr[u].s[0]].size + tr[u].cnt, u = tr[u].s[1];
        else return tr[u].v;
    }
}

int main() {
    
    scanf("%d%d", &n, &q);
    
    insert(-INF), insert(INF);
    
    while(n--) {
        int v;
        scanf("%d", &v);
        insert(v);
    }
    
    while(q--) {
        int op, x;
        scanf("%d%d", &op, &x);
        if(op == 1) {
            printf("%d\n", get_k(tr[root].size - x));
        }
        else {
            insert(x);
        }
    }
    
    
    return 0;
}

哥哥们， 我也不知道为什么我会WA，/kk