#include <bits/stdc++.h>

using namespace std;

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

const int nmax = 100005;

int n, m, aib[nmax];

void Update(int p, int x)
{
    while(p <= n)
    {
        aib[p] += x;
        p += (p & (-p));
    }
}

int Query(int p)
{
    int s = 0;
    while(p)
    {
        s += aib[p];
        p -= (p & (-p));
    }
    return s;
}

int binarysearch(int x)
{
    int st = 1, dr = n, vv;
    while(st <= dr)
    {
        int mid = (st + dr) / 2;
        vv = Query(mid);
        if(vv == x)
            return mid;
        if(vv < x)
            st = mid + 1;
        else
            dr = mid - 1;
    }
    return -1;
}

int main()
{
    fin >> n >> m;
    for(int i = 1; i <= n; ++i)
    {
        int x;
        fin >> x;
        Update(i, x);
    }
    while(m--)
    {
        int tip, x;
        fin >> tip >> x;
        if(tip == 2)
            fout << binarysearch(x) << "\n";
        else
        {
            int y;
            fin >> y;
            if(tip)
                fout << Query(y) - Query(x - 1) << "\n";
            else
                Update(x, y);

        }
    }
    return 0;
}