#include <iostream>
#include <fstream>
#define NMAX 100000

using namespace std;

ifstream f("aib.in");
ofstream g("aib.out");

int n,v[NMAX],bit[NMAX+1];

int getSum(int i)
{
    int s=0;
    while(i)
    {
        s+=bit[i];
        i-=i&(-i);
    }

    return s;
}

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

void buildTree()
{
    for(int i=0;i<n;++i)
        update(i,v[i]);
}

int findPos(int a)
{
    int s=0;
    for(int i=0;i<n;++i)
    {
        s+=v[i];
        if(s==a)
            return i+1;
    }
    return -1;
}

int main()
{
    int m;
    f>>n>>m;
    for(int i=0;i<n;++i)
        f>>v[i];

    buildTree();
    while(m--)
    {
        int x,a,b;
        f>>x;
        switch(x)
        {
        case 0:
            f>>a>>b;
            update(a,b);
            v[a-1]+=b;
            break;
        case 1:
            f>>a>>b;
            g<<getSum(b)-getSum(a-1)<<'\n';
            break;
        case 2:
            f>>a;
            g<<findPos(a)<<'\n';
            break;
        }
    }

    return 0;
}