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

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

int n, q;
int tree[maxn+2];

void update(int pos, int val)
{
    while(pos<=n)
    {
        tree[pos]+=val;
        pos+=(pos&-pos);
    }
}

int query(int pos)
{
    int sum=0;
    while(pos>0)
    {
        sum=sum+tree[pos];
        pos=pos-(pos&-pos);
    }
    return sum;
}

int main()
{
    int val, op, pos1, pos2;
    fin>>n>>q;
    for(int i=1; i<=n; i++)
    {
        fin>>val;
        update(i,val);
    }
    while(q--)
    {
        fin>>op;
        if(op==0)
        {
            fin>>pos1>>val;
            update(pos1,val);
        }
        else if(op==1)
        {
            fin>>pos1>>pos2;
            fout<<query(pos2)-query(pos1-1)<<'\n';
        }
        else
        {
            fin>>val;
            int st=1, dr=n;
            while(st<dr)
            {
                int mid=(st+dr)/2;
                if(query(mid)>=val)
                {
                    dr=mid;
                }
                else
                {
                    st=mid+1;
                }
            }
            fout<<st<<'\n';
        }
    }
    return 0;
}