#include <random>
#include <iostream>
using namespace std;
int N, K, Q, mod, A[15009], dp[15009];
bool isprime(int x) {
	if (x <= 1) return false;
	for (int i = 2; i * i <= x; ++i) {
		if (x % i == 0) return false;
	}
	return true;
}
int main() {
	random_device rd;
	uniform_int_distribution<int> p(600000000, 1050000000);
	while (!isprime(mod)) mod = p(rd);
	cin.tie(0);
	ios_base::sync_with_stdio(false);
	cin >> N >> K;
	for (int i = 0; i < N; ++i) cin >> A[i];
	dp[0] = 1;
	for (int i = 0; i < N; ++i) {
		if (A[i] > 0) {
			for (int j = K; j >= A[i]; --j) {
				dp[j] += dp[j - A[i]];
				if (dp[j] >= mod) dp[j] -= mod;
			}
		}
	}
	cin >> Q;
	for (int i = 0; i < Q; ++i) {
		int x, v;
		cin >> x >> v; --x;
		if (A[x] > 0) {
			for (int j = A[x]; j <= K; ++j) {
				dp[j] -= dp[j - A[x]];
				if (dp[j] < 0) dp[j] += mod;
				if (dp[j] < 0) dp[j] += mod;
			}
		}
		A[x] = v;
		if (A[x] > 0) {
			for (int j = K; j >= A[x]; --j) {
				dp[j] += dp[j - A[x]];
				if (dp[j] >= mod) dp[j] -= mod;
			}
		}
		cout << (dp[K] > 0 ? 1 : 0) << '\n';
	}
	return 0;
}