#include<cstdio>
#define MAX_N 100000
using namespace std;

int v[MAX_N+1], segTree[4*MAX_N+1], n, m, qlow, qhigh;

inline int sum(int x, int y) {
    return x + y;
}

void buildSegmentTree(int low, int high, int pos) {
    if(low == high)
        segTree[pos] = v[low];
    else {
        int mid = (low + high) >> 1;
        buildSegmentTree(low,mid,2*pos);
        buildSegmentTree(mid+1,high,2*pos+1);
        segTree[pos] = sum(segTree[2*pos],segTree[2*pos+1]);
    }
}

void updateSegmentTree(int low, int high, int pos) {
    if(low == high)
        segTree[pos] += qhigh;
    else {
        int mid = (low + high) >> 1;
        if(qlow <= mid)
            updateSegmentTree(low,mid,2*pos);
        else updateSegmentTree(mid+1,high,2*pos+1);
        segTree[pos] = sum(segTree[2*pos],segTree[2*pos+1]);
    }
}

int querySum(int low, int high, int pos) {
    if(qlow <= low && high <= qhigh)
        return segTree[pos];
    if(qlow > high || qhigh < low)
        return 0;
    int mid = (low + high) >> 1;
    return sum(querySum(low,mid,2*pos),querySum(mid+1,high,2*pos+1));
}

int binarySearch(int val) {
    int b, e, mid, s, pos = -1;
    b = 1, e = n;
    while(b <= e && pos == -1) {
        mid = (b + e) >> 1;
        qlow = 1;
        qhigh = mid;
        s = querySum(1,n,1);
        if(s == val)
            pos = mid;
        else if(val < s)
            e = mid - 1;
        else b = mid + 1;
    }
    return pos;
}

int main() {
    int i, op;
    FILE* fin, *fout;
    fin = fopen("aib.in","r");
    fout = fopen("aib.out","w");
    fscanf(fin,"%d%d",&n,&m);
    for(i = 1; i <= n; i++)
        fscanf(fin,"%d",&v[i]);
    buildSegmentTree(1,n,1);
    for(i = 0; i < m; i++) {
        fscanf(fin,"%d%d",&op,&qlow);
        if(op != 2)
            fscanf(fin,"%d",&qhigh);
        if(!op)
            updateSegmentTree(1,n,1);
        else if(op == 1)
            fprintf(fout,"%d\n",querySum(1,n,1));
        else fprintf(fout,"%d\n",binarySearch(qlow));
    }
    fclose(fin);
    fclose(fout);
    return 0;
}