#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#define int long long
#define double long double
#define pb push_back
#define endl '\n'
#define er erase
#define sz size
#define in insert
#define mp make_pair
#define fs first
#define sc second
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define mod 1000000007
#define INF LONG_LONG_MAX

int n, m, ar[100005], t[100005];

void build()
{
    for(int i=1;i<=n;i++)
    {
        int sum=0, ind=i;
        while(ind>=i-(i&(-i))+1)
        {
            sum+=ar[ind];
            ind--;
        }
        t[i]=sum;
    }
}

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

int sum(int x)
{
    int res=0;
    while(x)
    {
        res+=t[x];
        x-=(x&(-x));
    }
    return res;
}

void solve()
{
    ifstream cin("aib.in");
    ofstream cout("aib.out");
    cin>>n>>m;
    for(int i=1;i<=n;i++)
        cin>>ar[i];
    build();
    while(m--)
    {
        int op, a, b;
        cin>>op;
        if(op==0) // add b to number at pos a
        {
            cin>>a>>b;
            update(a, b);
        }
        if(op==1) // range sum [a, b]
        {
            cin>>a>>b;
            cout<<sum(b)-sum(a-1)<<endl;
        }
        if(op==2) //pos k so that sum of first k numbers is a
        {
            cin>>a;
            int l=1, r=n, mid=(l+r)/2, k=-1;
            while(l<=r)
            {
                int val=sum(mid);
                if(val==a){k=mid;r=mid-1;mid=(l+r)/2;}
                if(sum(mid)>a){r=mid-1;mid=(l+r)/2;}
                if(sum(mid)<a){l=mid+1;mid=(l+r)/2;}
            }
            cout<<k<<endl;
        }
    }
}

int32_t main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int tc=1;
    //cin>>tc;
    while(tc--)
    {
        solve();
    }
    return 0;
}