#include <bits/stdc++.h>
#define inf (0x7f7f7f7f)
#define Max(a, b) ((a) > (b) ? (a) : (b))
#define Min(a, b) ((a) < (b) ? (a) : (b))
typedef long long ll;
using namespace std;
template <class T>
inline void read(T &x){
    int ch = 0, f = 0; x = 0;
    for(; !isdigit(ch); ch = getchar()) if(ch == '-') f = 1;
    for(; isdigit(ch); ch = getchar()) x = x * 10 + ch - 48;
    if(f) x = -x;
}

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
template<class T>
using Oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

const int maxn = 2.5e5 + 5;
int n, m, q;
long long sum[maxn], sumb[maxn];

class SegmentTree{
public:
    static const int siz = 262144;
    long long dat[siz << 1], tag[siz << 1];

    void build(int x = 1, int l = 0, int r = siz - 1) {
        if (l == r) {
            if (l >= 1 && l <= n) dat[x] = sum[l];
            return;
        }
        int md = l + r >> 1;
        build(x << 1, l, md), build(x << 1 | 1, md + 1, r);
        return;
    }

    void update(int s, int t, int k, int x = 1, int l = 0, int r = siz - 1) {
        if (l >= s && r <= t) {
            tag[x] += k;
            dat[x] += k;
            return;
        }
        int md = l + r >> 1;
        if (s <= md) update(s, t, k, x << 1, l, md);
        if (t > md) update(s, t, k, x << 1 | 1, md + 1, r);
        dat[x] = min(dat[x << 1], dat[x << 1 | 1]) + tag[x];
    }
    
} seg;

int a[maxn], b[maxn];
Oset<pair<int, int> > A;

int main(){
    vector<int> veca, vecb;

    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; ++i) scanf("%d", a + i), veca.push_back(a[i]);
    for (int i = 1; i <= m; ++i) scanf("%d", b + i), vecb.push_back(b[i]);

    for (int i = 1; i <= n; ++i) A.insert(make_pair(-a[i], i));

    sort(vecb.begin(), vecb.end());
    sort(veca.begin(), veca.end()); reverse(veca.begin(), veca.end());
    for (int i = 0; i < m; ++i) sumb[i] = (i ? sumb[i - 1] : 0) + vecb[i];
    for (int k = 1; k <= n; ++k) sum[k] = sum[k - 1] - veca[k - 1];
    for (int k = 1; k <= n; ++k) {
        int p = lower_bound(vecb.begin(), vecb.end(), k) - vecb.begin();
        sum[k] += (p ? sumb[p - 1] : 0);
        sum[k] += 1ll * k * (m - p);
    }

    // for (int k = 1; k <= n; ++k) printf("%lld ", sum[k]); puts("");

    seg.build();

    scanf("%d", &q);
    for (int j = 1; j <= q; ++j) {
        int op, i; scanf("%d%d", &op, &i);
        if (op == 1 || op == 2) {
            A.erase(make_pair(-a[i], i));
            if (op == 1) ++a[i];
            else --a[i];
            A.insert(make_pair(-a[i], i));
            int k = A.order_of_key(make_pair(-a[i], i)) + 1;
            if (op == 1) seg.update(k, n, -1);
            else seg.update(k, n, 1);
        }
        else {
            if (op == 3) {
                ++b[i];
                if (max(b[i], 1) <= n) seg.update(max(b[i], 1), n, 1);
            }
            else {
                if (max(b[i], 1) <= n) seg.update(max(b[i], 1), n, -1);
                --b[i];
            }
        }

        int res = seg.dat[1];
        if (res >= 0) puts("1");
        else puts("0");
    }
    return 0;
}