#include <stdio.h>

#define int long long
#define MAX_N 100000
#define MAX_LOG 17

int aib[MAX_N + 1];

void update( int i, int a, int n ) {
    while ( i <= n ) {
        aib[i] += a;
        i += i & -i;
    }
}

int query( int i ) {
    int s;

    s = 0;
    while ( i > 0 ) {
        s += aib[i];
        i -= i & -i;
    }

    return s;
}

signed main() {
    FILE *fin, *fout;
    int n, q, tip, a, s, f, p, sum, pas, i;

    fin = fopen( "aib.in", "r" );

    fscanf( fin, "%lld%lld", &n, &q );
    for ( i = 1; i <= n; i++ ) {
        fscanf( fin, "%lld", &a );
        update( i, a, n );
    }

    fout = fopen( "aib.out", "w" );

    for ( i = 0; i < q; i++ ) {
        fscanf( fin, "%lld", &tip );
        if ( tip == 0 ) {
            fscanf( fin, "%lld%lld", &p, &a );
            update( p, a, n );
        }
        else if ( tip == 1 ) {
            fscanf( fin, "%lld%lld", &s, &f );
            fprintf( fout, "%lld\n", query( f ) - query( s - 1 ) );
        }
        else {
            fscanf( fin, "%lld", &s );

            sum = 0;
            pas = (1 << MAX_LOG);
            p = 0;
            while ( pas > 0 ) {
                if ( p + pas <= n && sum + aib[p + pas] <= s ) {
                    p += pas;
                    sum += aib[p];
                }
                pas >>= 1;
            }

            fprintf( fout, "%lld\n", sum == s ? p : -1 );
        }
    }

    return 0;
}