#include <fstream>
#include <algorithm>
#define mod 9901
#define nmax 100001
using namespace std;
ifstream cin("aib.in");
ofstream cout("aib.out");

int n, m, a, b, q, p, aib[nmax], v[nmax];

void update(int poz, int val)
{
    for(int i=poz; i<=n; i+=(i&(-i)))
        aib[i]+=val;
}

long long suma(int poz)
{
    long long sum=0;
    for(int i=poz; i>=1; i-=(i&(-i)))
        sum+=aib[i];
    return sum;
}

int cb(int st, int dr, int val)
{
    if(suma(1)>val)
        return -1;
    while(st<=dr)
    {
        int mid=(st+dr)/2;
        if(val==suma(mid))
            return mid;
        if(val>suma(mid))
            st=mid+1;
        else
            dr=mid-1;
    }
    return -1;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin>>n>>m;
    for(int i=1; i<=n; i++)
    {
        cin>>v[i];
        update(i,v[i]);
    }

    while(m--)
    {
        cin>>q;
        if(q==0)
        {
            cin>>a>>b;
            update(a,b);
        }
        if(q==1)
        {
            cin>>a>>b;
            cout<<suma(b)-suma(a-1)<<'\n';
        }
        if(q==2)
        {
            cin>>a;
            cout<<cb(1,n,a)<<'\n';
        }
    }
}