#include <fstream>

using namespace std;

const int NMAX = 1e5 + 1;

class InParser
{
private:
    FILE *fin;
    char *buff;
    int sp;

    char read_ch()
    {
        ++sp;
        if(sp == 4096)
        {
            sp = 0;
            fread(buff, 1, 4096, fin);
        }
        return buff[sp];
    }

public:
    InParser(const char* nume)
    {
        fin = fopen(nume, "r");
        buff = new char[4096]();
        sp = 4095;
    }

    InParser& operator >> (int &n)
    {
        char c;
        while(!isdigit(c = read_ch()) && c != '-');
        int sgn = 1;
        if(c == '-')
        {
            n = 0;
            sgn = -1;
        }
        else
        {
            n = c - '0';
        }
        while(isdigit(c = read_ch()))
        {
            n = 10 * n + c - '0';
        }
        n *= sgn;
        return *this;
    }
};

class OutParser
{
private:
    FILE *fout;
    char *buff;
    int sp;

    void write_ch(char ch)
    {
        if(sp == 50000)
        {
            fwrite(buff, 1, 50000, fout);
            sp = 0;
            buff[sp++] = ch;
        }
        else
        {
            buff[sp++] = ch;
        }
    }


public:
    OutParser(const char* name)
    {
        fout = fopen(name, "w");
        buff = new char[50000]();
        sp = 0;
    }
    ~OutParser()
    {
        fwrite(buff, 1, sp, fout);
        fclose(fout);
    }

    OutParser& operator << (int vu32)
    {
        if(vu32 <= 9)
        {
            write_ch(vu32 + '0');
        }
        else
        {
            (*this) << (vu32 / 10);
            write_ch(vu32 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (char ch)
    {
        write_ch(ch);
        return *this;
    }
    OutParser& operator << (const char *ch)
    {
        while(*ch)
        {
            write_ch(*ch);
            ++ch;
        }
        return *this;
    }
};

InParser fin("aib.in");
OutParser fout("aib.out");

int n, aib[NMAX];

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

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

int cb(int val)
{
    int i, step;
    for(step = 1; step < n; step <<= 1);
    for(i = 0; step; step >>= 1)
    {
        int poz = i + step;
        if(poz <= n && aib[poz] <= val)
        {
            val -= aib[poz];
            i = poz;
            if(!val) return i;
        }
    }
    return -1;
}

int main()
{
    int m, op, x, y;
    fin >> n >> m;
    for(int i = 1; i <= n; ++i)
    {
        fin >> x;
        add(i, x);
    }
    while(m--)
    {
        fin >> op;
        switch(op)
        {
        case 0:
            fin >> x >> y;
            add(x, y);
            break;
        case 1:
            fin >> x >> y;
            fout << sum(y) - sum(x - 1) << '\n';
            break;
        case 2:
            fin >> x;
            fout << cb(x) << '\n';
        }
    }
    return 0;
}