#include <iostream>
#include <fstream>
#include <algorithm>

///#include <tryhardmode>
///#include <GODMODE::ON>

using namespace std;

#define cin fin
#define cout fout

ifstream fin ("aib.in");
ofstream fout ("aib.out");

const int NMAX=1e5+5;

int v[NMAX];
int aib[NMAX];
long long saiz;
int n;

int lsb(int x)
{
    return x&(-x);
}

void update(int p,int val)
{
    while(p<=n)
    {
        aib[p]+=val;
        p+=lsb(p);
    }
}

long long query(int p)
{
    long long s=0;
    while(p>0)
    {
        s+=aib[p];
        p-=lsb(p);
    }
    return s;
}

long long solve_q(int x,int y)
{
    return query(y)-query(x-1);
}

int search_pos(int val)
{
    int s=0,p=0,i;
    for(i=saiz;i>0;i/=2)
    {
        if(i+p<=n)
        {
            if(s+aib[i+p]<val)
            {
                s+=aib[p+i];
                p+=i;
            }
        }
    }
    if(s+v[p+1]!=val)
        return -1;
    return p+1;
}

int main()
{
    int m,i,j,t,x,y;
    cin>>n>>m;
    for(i=1;i<=n;i++)
    {
        cin>>v[i];
        update(i,v[i]);
    }
    saiz=1;
    while(saiz*2<=n)
        saiz*=2;
    for(i=1;i<=m;i++)
    {
        int task;
        cin>>task;
        if(task==0)
        {
            cin>>x>>y;
            update(x,y);
            v[x]+=y;
        }
        else if(task==1)
        {
            cin>>x>>y;
            cout<<solve_q(x,y)<<"\n";
        }
        else
        {
            cin>>x;
            cout<<search_pos(x)<<"\n";
        }
    }
    return 0;
}