#include <fstream>
#define DIM 100010

using namespace std;

int Query1(int poz);
int Query2(int a);
void Update(int poz, int val);
int n, m;
int aib[DIM];

int Query1(int poz)
{
    int sum = 0;
    while(poz > 0)
    {
        sum += aib[poz];
        poz -= poz & (-poz);
    }
    return sum;
}

int Query2(int a)
{
    int left = 1, right = n, mid, poz = -1;
    while(left <= right)
    {
        mid = (left + right) / 2;
        int x = Query1(mid);
        if (x == a)
        {
            poz = mid;
            right = mid - 1;
        }
        else
        {
            if (x > a)
                right = mid - 1;
            else
                left = mid + 1;
        }
    }
    return poz;
}

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

int main()
{
    ifstream f("aib.in");
    ofstream g("aib.out");
    f >> n >> m;
    for (int i = 1;i <= n;++i)
    {
        int x;
        f >> x;
        Update(i, x);
    }
    for (int i = 1;i <= m;++i)
    {
        int code;
        f >> code;
        switch(code)
        {
            case 0:
            {
                int poz, val;
                f >> poz >> val;
                Update(poz, val);
                break;
            }
            case 1:
            {
                int left, right;
                f >> left >> right;
                left = Query1(left - 1);
                right = Query1(right);
                g << right - left << "\n";
                break;
            }
            case 2:
            {
                int a;
                f >> a;
                g << Query2(a) << "\n";
                break;
            }
        }
    }
    f.close();
    g.close();
    return 0;
}