#include <bits/stdc++.h>
//Soltan Cristian
#define fri(a, b) for (int i = (a); i < (b); ++i)
#define frj(a, b) for(int j = a; j < b; j++)
#define frk(a, b) for(int k = a; k < b; k++)
#define frm(a, b, i) for(int i = b; i >= a; i--)
#define ll long long
#define all(x) x.begin(), x.end()
#define mod 1000000007
#define pb push_back
#define st first
#define nd second
#define sz size()
#define rall(x) x.rbegin(), x.rend()
#define ct(x) cout << x
#define cts(x) cout << x << ' '
#define ctn(x) cout << x << '\n'
#define Y cout << "YES" << '\n'
#define N cout << "NO" << '\n'
using namespace std;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vb = vector<bool>;
using ml = map<ll, ll>;
using vii = vector<vector<int>>;
using vll = vector<vector<ll>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template <typename T>void read(T n, vector<T> &a){fri(0, n){cin >> a[i];}}
template<typename T>void print(T n, T m, vector<vector<T>> &dp){fri(0, n){ct('\n');frj(0, m){ct(setw(5));cts(dp[i][j]);}}}


const int mx = 100001;
string __fname = "aib"; ifstream in(__fname + ".in"); ofstream out(__fname + ".out");
#define cin in 
#define cout out


struct FenwickTree {
    vector<int> bit;  // binary indexed tree
    int n;

    FenwickTree(int n) {
        this->n = n;
        bit.assign(n, 0);
    }

    FenwickTree(vector<int> a) : FenwickTree(a.size()) {
        for (size_t i = 0; i < a.size(); i++)
            add(i, a[i]);
    }

    int sum(int r) {
        int ret = 0;
        for (; r >= 0; r = (r & (r + 1)) - 1)
            ret += bit[r];
        return ret;
    }

    int sum(int l, int r) {
        return sum(r) - sum(l - 1);
    }

    void add(int idx, int delta) {
        for (; idx < n; idx = idx | (idx + 1))
            bit[idx] += delta;
    }
};

void solve(){
    int n, m;
    cin >> n >> m;
    FenwickTree t(n);
    vi a(n);
    fri(0, n){
        cin >> a[i];
        t.add(i, a[i]);
    }
    fri(0, m){
        int q;
        cin >> q;
        if(q == 0){
            int x, y;
            cin >> x >> y;
            t.add(x - 1, y);
        }
        else if(q == 1){
            int x, y;
            cin >> x >> y;
            ctn(t.sum(x - 1, y - 1));
        }
        else{
            int x;
            cin >> x;
            int rs = -1;
            int l = 0, r = n - 1;
            while(l <= r){
                int mid = (l + r)/ 2;
                if(t.sum(mid) == x){
                    rs = mid + 1;
                    r = mid - 1;
                }
                else if(t.sum(mid) > x){
                    r = mid - 1;
                }
                else l = mid + 1;
            }
            if(t.sum(0) == x){
                ctn(1);
                continue;
            }
            ctn(rs);
        }
    }


}
 
  
int main()
{   
    ios_base::sync_with_stdio(0); cin.tie(0); ct(fixed); ct(setprecision(2)); 
    // int t;
    // cin >> t;
    // while(t--)
        solve();
}