#include <fstream>
using namespace std;

int v[100005], n;

void update (int a, int b) {
    int k = 0;

    while (a <= n) {
        v[a] += b;
        while (!(a & 1 << k))
            k++;
        a = a + (1<<k);
        k++;
    }
}

long long query (int a) {
    long long sum = 0, k = 0;

    while (a) {
        sum += v[a];
        while (!(a & (1 << k)))
            k++;
        a = a - (1 << k);
    }

    return sum;
}

int query2 (int b) {
    int i, k, sw = 0, j, sum = 0;

    for (i = 1; i <= n && !sw; i++) {
        sum = 0;
        k = 0;
        j = i;
        while (j) {
            sum += v[j];
            while (!(j & (1 << k)))
                k++;
            j = j - (1 << k);
        }
        if (sum == b) {
            sw = 1;
            j = i;
        }
    }
    return j;
}

int main () {
    int m, a, b, c, i;
    long long sum;

    ifstream in ("aib.in");
    in >> n >> m;
    for (i = 1; i <= n; i++) {
        in >> a;
        update (i, a);
    }
    ofstream out ("aib.out");
    for (i = 1; i <= m; i++) {
        in >> a;
        if (a == 0) {
            in >> b >> c;
            update (b, c);
        }
        else if (a == 1) {
                in >> b >> c;
                sum = query (c) - query(b - 1);
                out << sum << '\n';
        }
                else {
                    in >> b;
                    sum = query2 (b);
                    out << sum << '\n';
                }
    }
    out.close();
    in.close();

    return 0;
}