#include<iostream>
#include<fstream>
#define NMAX 100002
using namespace std;

ifstream f("aib.in");
ofstream g("aib.out");

int n,m;
long long tree[NMAX];

long long GetElement(int poz)
{
    long long suma = 0;
    while(poz)
    {
        suma = suma + tree[poz];
        poz = poz - (poz&(-poz));
    }
    return suma;
}

void Update(int poz, int x)
{
    while(poz <= n)
    {
        tree[poz] = tree[poz] + x;
        poz = poz + (poz & (-poz));
    }
}

void Citire()
{
    f>>n>>m;
    int x;
    for(int i=1;i<=n;i++)
    {
        f>>x;
        Update(i,x);
    }
}

void GetSum(int st,int dr)
{
    long long sum = 0,sum1=0;
    while(dr)
    {
        sum = sum + tree[dr];
        dr = dr - (dr&(-dr));
    }
    while(st)
    {
        sum1 = sum1 + tree[st];
        st = st - (st&(-st));
    }
    g<<sum-sum1<<"\n";
}

int GetFirstKSum(long long x)
{
    //cout<<18 - (18 & (-18));
    int st = 1,dr = n;
    while(st<=dr)
    {
        int mij = (st+dr)/2;
        long long val = GetElement(mij);
        //cout<<tree[mij]<<" ";
        if(val == x)
        {
            return mij;
        }
        if(val>x)
        {
            dr=mij-1;
        }
        else if(val<x)
        {
            st = mij+1;
        }
    }
    return -1;
}

void Solve()
{
    for(int i=1;i<=m;i++)
    {
        int c;
        long long a,b;
        f>>c>>a;
        if(c==0)
        {
            f>>b;
            Update(a,b);
        }
        if(c==1)
        {
            f>>b;
            GetSum(a-1,b);
        }
        if(c==2)
        {
            g<<GetFirstKSum(a)<<"\n";
        }
    }
}

int main()
{
    Citire();
    for(int i=1;i<=n;i++)
    {
        //cout<<tree[i]<<" ";
    }
    Solve();
}