#include<bits/stdc++.h>

#define ll long long

#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

using namespace std;

struct segtree {

    vector<int> tree;
    int size;

    const int zero = 0;

    void init(int n) {
        size = 1;
        while (size < n)size *= 2;
        tree.assign(size * 2 - 1, 0);
    }

    void build(vector<int> &a, int x, int lx, int rx) {
        if (rx - lx == 1) {
            if (lx < a.size())
                tree[x] = a[lx];
        } else {
            int mid = (lx + rx) >> 1;
            build(a, 2 * x + 1, lx, mid);
            build(a, 2 * x + 2, mid, rx);
            tree[x] = tree[2 * x + 1] + tree[2 * x + 2];
        }
    }

    void build(vector<int> &a) {
        init(a.size());
        build(a, 0, 0, size);
    }

    void set(int i, int v, int x, int lx, int rx) {
        if (rx - lx == 1) {
            tree[x] = v;
            return;
        }
        int mid = (lx + rx) >> 1;
        if (i < mid)set(i, v, 2 * x + 1, lx, mid);
        else set(i, v, 2 * x + 2, mid, rx);
        tree[x] = tree[2 * x + 1] + tree[2 * x + 2];
    }

    void set(int i, int v) {
        set(i, v, 0, 0, size);
    }

    int find(int k, int x, int lx, int rx) {
        if (rx - lx == 1) {
            return lx;
        }
        int m = (lx + rx) >> 1;
        if (k < tree[2 * x + 1])return find(k, 2 * x + 1, lx, m);
        else return find(k - tree[2 * x + 1], 2 * x + 2, m, rx);
    }

    int find(int k) {
        find(k, 0, 0, size);
    }
};

int32_t main() {
    fast
    int n, q;
    cin >> n >> q;
    vector<int> a(n);
    for (auto &i: a)cin >> i;
    segtree st;
    st.build(a);
    while (q--) {
        int c;
        cin >> c;
        if (c == 1) {
            int i;
            cin >> i;
            st.set(i, 1 - a[i]);
            a[i] = 1 - a[i];
        } else {
            int k;
            cin >> k;
            cout << st.find(k) << endl;
        }
    }
    return 0;
}
/*
 * @Nargulyev
 */