# include <cstdio>
#include <fstream>
# define ub(x) (x&(-x))
using namespace std;
int n, ics, w;
int aib[100010];
inline void nou (int x, int i)
{
    int k;
    for (k = i; k <= n; k+=ub(k))
        aib[k] += x;
}

inline int ss (int x)
{
    int k, rez = 0;
    for (k = x; k > 0; k-=ub(k))
        rez += aib[k];

    return rez;
}

inline int cautare (int x)
{
    int st = 1 , dr = n;
    int mij;
    while ( st <= dr )
    {
        mij = (st + dr) / 2;
        if (x == ss(mij) ) return mij;
        else if (x > ss(mij)) st = mij+1;
        else  dr = mij-1;
    }
    return -1;
}

int main ()

{
    freopen("aib.in","r",stdin);
    ofstream g ("aib.out");

    scanf("%d%d",&n,&ics);

    int i,x,y;

    for (i = 1; i <= n; i++){
        scanf("%d",&x);
        nou(x,i);
    }

    for (i = 1; i <= ics; i++)
    {
        scanf("%d",&w);

        if (w == 0)
        {
            scanf("%d%d",&x,&y);
            nou(y,x);
        }

        if (w == 1)
        {
            scanf("%d%d",&x,&y);
            g<<ss(y) - ss (x-1)<<'\n';
        }

        if (w == 2)
        {
            scanf("%d",&x);
            g<<cautare(x)<<'\n';

        }
    }

    return 0;
}