#include <cstdio>

using namespace std;

const int nmx = 100002;

int n,m;
int v[nmx];

int putere(int val)
{
    return val & (-val);
}

int query(int pos)
{
    int sum = 0;

    while(pos)
    {
        sum += v[pos];
        pos -= putere(pos);
    }

    return sum;
}

void update(int pos, int val)
{
    while(pos <= n)
    {
        v[pos] += val;
        pos += putere(pos);
    }
}

void citire()
{
    scanf("%d %d", &n, &m);
    for(int i = 1; i <= n; ++i)
    {
        int val;
        scanf("%d", &val);
        update(i,val);
    }
}

int caut_binar(int val)
{
    int st = 1, dr = n;

    while(st <= dr)
    {
        int mij = (st + dr) / 2;
        int calc = query(mij);

        if(calc == val)
        {
            return mij;
        }
        else if(calc > val)
            dr = mij - 1;
        else
            st = mij + 1;
    }

    return -1;
}

void rezolvare()
{
    for(int i = 1; i <= m; ++i)
    {
        int a,b,c;
        scanf("%d %d", &a, &b);

        if(a < 2)
            scanf("%d", &c);

        if(a == 0)
            update(b,c);
        else if(a == 1)
            printf("%d\n", query(c) - query(b-1));
        else
            printf("%d\n", caut_binar(b));
    }
}

int main()
{
    freopen("aib.in", "r", stdin);
    freopen("aib.out", "w", stdout);
    citire();
    rezolvare();
    return 0;
}