#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, k; cin >> n >> k;
	vector<int>a(n);
	rep(i, n) cin >> a[i];
	int q; cin >> q;
	vector<mint> dp(15001);
	dp[0] = 1;
	rep(i, n) {
		if (!a[i])continue;
		rrep(j, 15001) {
			int k = j + a[i];
			if (k > 15000)continue;
			dp[k] += dp[j];
		}
	}
	while (q--) {
		int x, v; cin >> x >> v;
		x--;
		if (a[x]) {
			rep(i, 15001) {
				int j = i + a[x];
				if (j > 15000)continue;
				dp[j] -= dp[i];
			}
		}
		a[x] = v;
		if (a[x]) {
			rrep(i, 15001) {
				int j = i + a[x];
				if (j > 15000)continue;
				dp[j] += dp[i];
			}
		}
		cout << (0 != dp[k] ? 1 : 0) << endl;
	}
	return 0;
}