#include <bits/stdc++.h>
using namespace std;
#define ll long long unsigned
#define pb push_back
#define mp make_pair

int aib[100005],n;

void update(int a, int b){
    for(;a <= n;a += a&(-a)){
        aib[a] += b;
    }
}

int query(int a){
    int ans = 0;
    for(;a;a -= a&(-a)){
        ans += aib[a];
    }
    return ans;
}

int binarySearch(int x){
    int i,step;
    for(step = 1;step <= n;step <<= 1);
    for(i = 0;step;step >>= 1){
        int sum = query(i+step);
        if(i+step <= n && sum <= x){
            i += step;
            if(sum == x){
                return i;
            }
        }
    }
    if(query(i) == x){
        return i;
    }
    return -1;
}

int main(){
    int i,m,a,op,b,x;
    freopen("aib.in", "r", stdin);
    freopen("aib.out", "w", stdout);
    scanf("%d %d",&n,&m);
    for(i = 1;i <= n;i++){
        scanf("%d",&x);
        update(i, x);
    }
    for(i = 1;i <= m;i++){
        scanf("%d %d",&op,&a);
        if(op == 0){
            scanf("%d",&b);
            update(a, b);
        }else if(op == 1){
            scanf("%d",&b);
            printf("%d\n",query(b)-query(a-1));
        }else{
            printf("%d\n",binarySearch(a));
        }
    }
    return 0;
}