#include<bits/stdc++.h>
#define ll long long
#define fi first
#define sc second
#pragma GCC optimize ("O3")
using namespace std;
ifstream f("aib.in");
ofstream g("aib.out");
int tip, a, b, n, q, v[200001], aib[200001];
void update(int nod, int val)
{
    for(int i=nod; i<=n; i+=(i&(-i)))
        aib[i]+=val;
}
int query(int nod)
{
    int sum=0;
    for(int i=nod; i; i-=(i&(-i)))
        sum+=aib[i];
    return sum;
}
int cb(int x)
{
    int st=1, dr=n, anscb=0, mid;
    while(st<=dr)
    {
        mid=(st+dr)/2;
        if(query(mid)<x)
        {
            anscb=mid;
            st=mid+1;
        }
        else
            dr=mid-1;
    }
    if(query(anscb+1)==x)
        return anscb+1;
    return -1;
}
int main()
{
    f>>n>>q;
    for(int i=1; i<=n; i++)
        f>>v[i], update(i, v[i]);
    for(; q; q--)
    {
        f>>tip;
        if(tip==0)
        {
            f>>a>>b;
            update(a, b);
        }
        else if(tip==1)
        {
            f>>a>>b;
            g<<query(b)-query(a-1)<<'\n';
        }
        else
        {
            f>>a;
            g<<cb(a)<<'\n';
        }

    }
    return 0;
}