#include <fstream>
#include <vector>
using namespace std;

inline
int next(const int x) {
    int i = 0;
    while (x && !(x & (1 << i))) ++i;
    return x + (1 << i);
}

inline
int prev(const int x) {
    int i = 0;
    while (x && !(x & (1 << i))) ++i;
    return x - (1 << i);
}

void update(int i, int x, vector<int>& aib) {  // operation 0
    for (; i < aib.size(); i = next(i))
        aib[i] += x;
}

int prefixSum(int i, const vector<int>& aib) {  // operation 1
    int sum = 0;
    for (; i; i = prev(i)) sum += aib[i];
    return sum;
}

inline
int search(int sum, const vector<int>& aib) {  // operation 2
    int li = 1, ls = aib.size(), midd;
    
    while (li < ls) {
        midd = li + (ls - li) / 2;
        if (prefixSum(midd, aib) < sum)
            li = midd + 1;
        else
            ls = midd;
    }
    
    return (li < aib.size() && prefixSum(li, aib) == sum) ? li : -1;    
}

int main() {
    ifstream fin("aib.in");
    ofstream fout("aib.out");
    
    int n, m;
    fin >> n >> m;
    vector<int> aib(n+1, 0);
    
    for (int x, i = 1; n; --n, ++i) {
        fin >> x;
        update(i, x, aib);
    }
    
    for (int op, a, b; m; --m) {
        fin >> op;
        if (op == 0) {
            fin >> a >> b;
            update(a, b, aib);
        }
        else if (op == 1) {
            fin >> a >> b;
            fout << prefixSum(b, aib) - prefixSum(a - 1, aib) << '\n';        
        }
        else {
            fin >> a;
            fout << search(a, aib) << '\n';	
        }
    }
    
    return 0;
}