#include <bits/stdc++.h>
using namespace std;
typedef int64_t lint;
#define rep(i, n) for(int i=0; i<n; i++)
#define repx(i, l, n) for(int i=l; i<n; i++)
#define all(v) v.begin(), v.end()
#define show(x) cout << #x << ": " << x << endl;
#define list(x) cout << #x << ": " << x << "  ";
#define pb push_back
using vi = vector<lint>;
using vvi = vector<vector<lint>>;
template<class T> inline void vin(vector<T>& v) { rep(i, v.size()) cin >> v.at(i); }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> inline void drop(T x) { cout << x << endl; exit(0); }
template<class T> void vout(vector<T> v) { rep(i, v.size()) { cout << v.at(i) << ' '; } cout << endl; }
constexpr lint LINF = LLONG_MAX/2;

int main() {
	lint N, M, Q;
	cin >> N >> M;
	vi v(M);
	vin(v);

	lint a=0, b=0, c=0, x, y, z;
	set<pair<lint, lint>> s;
	rep(i, M) {
		s.insert({-v[i], -i});
	}
	cin >> Q;
	rep(_, Q) {
		cin >> x >> y >> z;
		y--;
		if (x == 1) {
			s.erase({-v[y], -y});
			v[y] += z;
			s.insert({-v[y], -y});
		} else if (x == 2) {
			s.erase({-v[y], -y});
			v[y] -= z;
			s.insert({-v[y], -y});
		} else {
			tie(a, b) = *s.begin();
			std::cout << 1-b << '\n';
		}
	}
}