import std.stdio, std.array, std.string, std.conv, std.algorithm;
import std.typecons, std.range, std.random, std.math, std.container;
import std.numeric, std.bigint, core.bitop;

immutable long MOD = 10^^9 + 7;

void main() {
    auto s = readln.split.map!(to!long);
    auto N = s[0];
    auto M = s[1].to!int;
    auto A = readln.split.map!(to!long).array;

    auto st = new SegmentTree!(Tuple!(long, int), max, tuple(-1L, 0))(M);
    foreach (i, a; A) st.assign(i.to!int, tuple(a, i.to!int));

    auto Q = readln.chomp.to!int;

    foreach (_; 0..Q) {
        s = readln.split.map!(to!long);
        if (s[0] == 1) {
            auto x = s[1].to!int - 1;
            auto y = s[2];
            auto v = st.query(x, x);
            st.assign(x, tuple(v[0]+y, v[1]));
        } else if (s[0] == 2) {
            auto x = s[1].to!int - 1;
            auto y = s[2];
            auto v = st.query(x, x);
            st.assign(x, tuple(v[0]-y, v[1]));
        } else {
            (st.query(0, M-1)[1] + 1).writeln;
        }
    }
}

class SegmentTree(T, alias op, T e) {
    T[] table;
    int size;
    int offset;

    this(int n) {
        size = 1;
        while (size <= n) size <<= 1;
        size <<= 1;
        table = new T[](size);
        fill(table, e);
        offset = size / 2;
    }

    void assign(int pos, T val) {
        pos += offset;
        table[pos] = val;
        while (pos > 1) {
            pos /= 2;
            table[pos] = op(table[pos*2], table[pos*2+1]);
        }
    }

    T query(int l, int r) {
        return query(l, r, 1, 0, offset-1);
    }

    T query(int l, int r, int i, int a, int b) {
        if (b < l || r < a) {
            return e;
        } else if (l <= a && b <= r) {
            return table[i];
        } else {
            return op(query(l, r, i*2, a, (a+b)/2), query(l, r, i*2+1, (a+b)/2+1, b));
        }
    }
}