#include <bits/stdc++.h>

using namespace std;

class FenwickTree
{
private :
    int _n;
    vector <int> a;
    int lsb(int i)
    {
        return i & (-i);
    }
public:
    FenwickTree (int n)
    {
        a.resize(n + 1);
        _n = n;
    }
    void update(int pos, int val)
    {
        for(int i = pos; i <= _n; i += lsb(i))
            a[i] += val;
    }
    int queryRange(int pos)
    {
        int sum = 0;
        for(int i = pos; i >= 1; i -= lsb(i))
            sum += a[i];
        return sum;
    }
    int query(int st, int dr)
    {
        return queryRange(dr) - queryRange(st - 1);
    }
    int binarySearch(int val)
    {
        int r = 0, pas, cursum = 0;
        int L = log2(_n);

        pas = 1 << L;
        while(pas)
        {
            if(r + pas<= _n &&  cursum + a[r + pas] <= val)
            {
                cursum += a[r + pas];
                r += pas;
                if(cursum == val)
                    return r;
            }
            pas >>= 1;
        }
        return -1;
    }
};

int n, m;

int main()
{
    ios_base :: sync_with_stdio(0);
    cin.tie(0);

    freopen("aib.in", "r", stdin);
    freopen("aib.out", "w", stdout);

    cin >> n >> m;
    FenwickTree aib(n);
    for(int i = 1; i <= n; i++)
    {
        int val;
        cin >> val;
        aib.update(i, val);
    }

    for(int i = 1; i <= m; i ++)
    {
        int cer;
        cin >> cer;
        if(cer == 0)
        {
            int a, b;
            cin >> a >> b;
            aib.update(a, b);
        }
        else if(cer == 1)
        {
            int a, b;
            cin >> a >> b;
            cout << aib.query(a, b) << "\n";
        }
        else
        {
            int x;
            cin >> x;
            cout << aib.binarySearch(x) << "\n";
        }
    }
    return 0;
}