#include <fstream>
using namespace std;

int v[100005], n;
long long vec[100005];

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 binary (int b) {
    int st = 1, dr = n, mij;

    while (st <= dr) {
        mij = (st + dr) >> 1;
        if (vec[mij] == b)
            return mij;
        else if (vec[mij] > b)
            dr = mij - 1;
        else st = mij + 1;
    }
    return -1;
}

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;
        vec[i] = vec[i - 1] + 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;
                    out << binary (b) << '\n';
                }
    }
    out.close();
    in.close();

    return 0;
}