#include <iostream>
#include <cstdio>
using namespace std;

int v[100500],n,m,a,b,type;

void actualizare(int index, int valoare)
{
    while(index<=n)
    {
        v[index]+=valoare;
        int p = ((index^(index - 1))+1)>>1;
        index += p;
    }
}

int suma(int index)
{
    int s=0;
    while(index)
    {
        s+=v[index];
        index = index&(index-1);
    }
    return s;
}

int cautare(int sum, int st, int dr)
{
    if(st>dr)
        return -1;

    int mij = (st+dr)/2;
    int S = suma(mij);
    if(S == sum)
    {
        while(suma(mij-1)== sum)
            mij--;
        return mij;
    }
    else if(S > sum)
    {
        cautare(sum,st,mij-1);
    }
    else if(S < sum)
    {
        cautare(sum,mij+1,dr);
    }


}

int main()
{
    freopen("aib.in","r",stdin);
    freopen("aib.out","w",stdout);

    scanf("%d%d",&n,&m);
    for(int i=1; i<=n; i++)
    {
        scanf("%d",&a);
        actualizare(i,a);
    }

    for(int i=1; i<=m; i++)
    {
        scanf("%d",&type);
        if(type == 0)
        {
            scanf("%d%d",&a,&b);
            actualizare(a,b);

        }
        else if(type == 1)
        {
            scanf("%d%d",&a,&b);
            printf("%d\n",suma(b)-suma(a-1));
        }
        else if(type == 2)
        {
            int j;
            scanf("%d",&a);
            printf("%d\n",cautare(a,1,n+1));
        }

    }



    return 0;
}