#include <cstdio>
#include <algorithm>
using  namespace std;
#define MAX 100001

int n,a[MAX];

void update(int idx,int val){
    while(idx <= n)
    {
        a[idx] += val;
        idx += idx&-idx;
    }
}

int read(int idx){
    int sum = 0;
    while(idx > 0)
    {
        sum += a[idx];
        idx -= idx&-idx;
    }
    return sum;
}

int b_search(int x){
    int l = 1,r = n,m;
    while(l<r)
    {
        m = (l+r)/2;
        if(read(m)>=x) r = m; else l = m + 1;
    }
    return read(r) == x ? r : -1;
}

int main(){
    int m,c,x,y;
    freopen("aib.in","r",stdin);
    freopen("aib.out","w",stdout);
        scanf("%d %d",&n,&m);
        for(int i=1;i<=n;i++)
        {
            x = i;
            scanf("%d",&y);
            update(x,y);
        }
        while(m--)
        {
            scanf("%d",&c);
            switch(c){
                case 0: scanf("%d %d",&x,&y); update(x,y); break;
                case 1: scanf("%d %d",&x,&y); printf("%d\n",read(y)-read(x-1)); break;
                case 2: scanf("%d",&x); printf("%d\n",b_search(x)); break;
            }
        }
    return 0;
}