#include <bits/stdc++.h>
#pragma GCC diagnostic ignored "-Wunused-result"
using namespace std; typedef long long ll; typedef unsigned long long ull; typedef vector<int> vi; typedef vector<ll> vl; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef vector<pii> vii; typedef vector<pll> vll;

template<class T> std::istream& operator>>(std::istream& stream, vector<T> &v) { for (T& t: v) { stream >> t; } return stream; } template <class T> std::ostream& operator<<(std::ostream& stream, const vector<T> &v) { for (const T& t : v) { stream << t << ' '; } return stream; } template <class T, class U> std::istream& operator>>(std::istream& stream, pair<T, U>& p) { return stream >> p.first >> p.second; } template <class T, class U> std::ostream& operator<<(std::ostream& stream, const pair<T, U>& p) { return stream << p.first << ' ' << p.second << ' '; } 

template<typename T> void read(T& t) { cin >> t; } template<typename T, typename... TArgs> void read(T& t, TArgs&&... args) { read(t); read(forward<TArgs>(args)...); } template <typename T> void readc(T& t); template<> void readc(int& v) { scanf("%d", &v); } template<> void readc(unsigned int& v) { scanf("%u", &v); } template<> void readc(char& v) { scanf(" %c", &v); } template<> void readc(long long& v) { scanf("%lld", &v); } template<> void readc(unsigned long long& v) { scanf("%llu", &v); } template<> void readc(float& v) { scanf("%f", &v); } template<> void readc(double& v) { scanf("%lf", &v); } template<size_t sz> void readc(char (&str)[sz]) { scanf("%s", str); } template<> void readc(char*& str) { scanf("%s", str); } template<typename E, typename U> void readc(pair<E, U>& v) { readc(v.first); readc(v.second); } template<typename E> void readc(vector<E>& v) { for (E& e : v) readc(e); } template<typename T, typename... TArgs> void readc(T& t, TArgs&&... args) { readc(t); readc(forward<TArgs>(args)...); }

template <typename T> void printc(T t); template<> void printc(int v) { printf("%d ", v); } template<> void printc(unsigned int v) { printf("%u ", v); } template<> void printc(char v) { printf("%c ", v); } template<> void printc(long long v) { printf("%lld ", v); } template<> void printc(unsigned long long v) { printf("%llu ", v); } template<> void printc(float v) { printf("%f ", v); } template<> void printc(double v) { printf("%lf ", v); } template<> void printc<char *>(char *str) { printf("%s ", str); } template<> void printc<const char *>(const char *str) { printf("%s ", str); } template<typename E, typename U> void printc(const pair<E, U>& v) { printc(v.first); printc(v.second); } template<typename E> void printc(const vector<E>& v) { for (const E& e : v) printc(e); } template<typename T, typename... TArgs> void printc(const T& t, TArgs&&... args) { printc(t); printc(forward<TArgs>(args)...); }

template <typename T> void __DEBUG_BASE(const T& t) { cout << t; } template <typename T, typename... TArgs> void __DEBUG_BASE(const T& t, TArgs&&... args) { __DEBUG_BASE(t); cout << ", "; __DEBUG_BASE(forward<TArgs>(args)...); } template <typename... TArgs> void __DEBUG_IMPL(TArgs&&... args) { __DEBUG_BASE(forward<TArgs>(args)...); } 

char lower(char ch) { if (ch >= 'A' && ch <= 'Z') return ch - 'A' + 'a'; return ch; } char upper(char ch) { if (ch >= 'a' && ch <= 'z') return ch - 'a' + 'A'; return ch; } array<char, 5> VOWELS = {'a','e','i','o','u'}; bool isvowel(char ch) { return find(VOWELS.begin(), VOWELS.end(), lower(ch)) != VOWELS.end(); }; bool isupper(char ch) { return ch >= 'A' && ch <= 'Z'; } bool islower(char ch) { return ch >= 'a' && ch <= 'z'; } 

#define IO ios::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL)
#define endl '\n'
#define CF_FILE freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout)
#define PB_FILE(nm) freopen(nm ".in", "r", stdin); freopen(nm ".out", "w", stdout)
#define debug(...) cout << "[" << (#__VA_ARGS__) << "] = "; __DEBUG_IMPL(__VA_ARGS__); cout << endl

// using uint = size_t;

int main()
{
    IO;
    // CF_FLIE;
    PB_FILE("aib");

    int n, m;
    readc(n,m);
    vector<int> bitree(n);
    readc(bitree);

    function<pair<int, int>(int)> build_at = [&] (int idx) {
        int dn = idx - (idx & (-idx)) + 1;
        int i = idx - 1;
        while (i >= dn) {
            auto p = build_at(i);
            i = p.first;
            bitree[idx - 1] += p.second;
        }
        return pair<int, int>{dn - 1, bitree[idx - 1]};
    };

    function<int(int)> sum_at = [&] (int idx) {
        int i = idx;
        int sum = 0;
        while (i > 0) {
            sum += bitree[i - 1];
            i -= (i & (-i));
        }
        return sum;
    };
    int i = n;
    while (i > 0) {
        i = build_at(i).first;
    }

    while (m--) {
        int op;
        readc(op);
        if (op == 0) {
            int j, val;
            readc(j, val);

            while (j <= n) {
                bitree[j - 1] += val;
                j += (j & (-j));
            }
        } else if (op == 1) {
            int i, j;
            readc(i, j);
            if (i < j) swap(i, j);
            printf("%d\n", sum_at(i) - sum_at(j - 1));
        } else if (op == 2) {
            int s;
            readc(s);
            int low = 1, high = n;
            int res = -1;
            while (low <= high) {
                int mid = low + (high - low) / 2;
                int sm = sum_at(mid);
                if (sm == s) {
                    res = mid;
                    break;
                } else if (sm > s) {
                    high = mid - 1;
                } else {
                    low = mid + 1;
                }
            }
            printf("%d\n", res);
        }
    }
}