#include <iostream>
#include <bitset>
#include <cstdio>

using namespace std;

const int N = 15010;

bitset<N> f;
int n, k, q, a[N];

int main() {
    // freopen("superset.in", "r", stdin);
    // freopen("superset.out", "w", stdout);

    scanf("%d%d", &n, &k);
    for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
    scanf("%d", &q);
    while (q--) {
        int x, v;
        scanf("%d%d", &x, &v);
        a[x] = v;
        f.reset();
        f.set(0);
        for (int i = 1; i <= n; ++i) {
            if (a[i] > k || a[i] == 0) continue;
            f |= f << a[i];
        }
        printf("%d\n", f.test(k));
    }

    return 0;
}