#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef pair<ll, ll> LP;
typedef vector<ll> vec;
typedef vector<string> svec;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-8;

int dp[15001];

int n, k;
void rev(int x) {
	if (x == 0)return;
	for (int i = x; i <= k; i++) {
		dp[i] = dp[i] - dp[i - x];
		if (dp[i] < 0)dp[i] += mod;
	}
}
void add(int x) {
	if (x == 0)return;
	for (int i = k; i >= 0; i--) {
		dp[i] = dp[i] + dp[i - x];
		if (dp[i] >= mod)dp[i] -= mod;
	}
}

void solve() {
	cin >> n >> k;
	dp[0] = 1;
	vector<int> a(n);
	rep(i, n) {
		cin >> a[i];
		add(a[i]);
	}
	int q; cin >> q;
	rep(i, q) {
		int x, v; cin >> x >> v; x--;
		rev(a[x]);
		a[x] = v; add(v);
		if (dp[k]) {
			cout << 1 << endl;
		}
		else {
			cout << 0 << endl;
		}
	}
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init();
	solve();
	//cout << "finish" << endl;
	//stop
	return 0;
}