#include <fstream>

using namespace std;

ifstream fin("aib.in");
ofstream fout("aib.out");

int tree[100001];
int N, M, op;

void update(int idx, int val)
{
    while(idx<=N)
    {
        tree[idx] += val;
        idx += (idx & -idx);
    }
}

int query(int idx)
{
    int sum=0;
    while(idx>0)
    {
        sum += tree[idx];
        idx -= (idx & -idx);
    }
    return sum;
}

int search(int x)
{
    int st=1, dr=N;
    while(st<=dr)
    {
        int m=(st+dr)/2;
        if(query(m)==x)
            return m;
        if(query(m)>x)
            dr=m-1;
        else
            st=m+1;
    }
    return -1;
}

int main()
{
    fin>>N>>M;
    for(int i=1; i<=N; ++i)
    {
        int x;
        fin>>x;
        update(i, x);
    }
    for(int i=1; i<=M; ++i)
    {
        int x, a, b;
        fin>>x;
        switch(x)
        {
        case 0:
            fin>>a>>b;
            update(a, b);
            break;
        case 1:
            fin>>a>>b;
            fout<<query(b) - query(a-1)<<'\n';
            break;
        case 2:
            fin>>a;
            fout<<search(a)<<'\n';
            break;
        };
    }
    return 0;
}