#include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <queue>
#include <stack>
#include <iomanip>


using namespace std;

#define REP(i, n) for(ll i = 0;i < n;i++)
#define REPR(i, n) for(ll i = n;i >= 0;i--)
#define FOR(i, m, n) for(ll i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define REPO(i, n) for(ll i = 1;i <= n;i++)
#define ll long long
#define INF (ll)1 << 60
#define MINF (-1 * INF)
#define ALL(n) n.begin(),n.end()
#define MOD (ll)1000000007
#define P pair<ll, ll>

bool dp[254000000];

ll n, k, t[15000];
set<ll> s;
int main() {
	s.insert(0);
	cin >> n >> k;
	REP(i, n) {
		ll a;
		cin >> a;
		t[i] = a;
		set<ll> nexts = s;
		for (auto& i : s) {
			nexts.insert(i + a);
		}
		s = nexts;
	}
	for (auto& i : s)
	{
		dp[i] = true;
		//cout << i << " a" << endl;
	}
	ll q;
	cin >> q;
	REP(i, q) {
		ll x, a;
		cin >> x >> a;
		x--;
		k += t[x] - a;
		t[x] = a;
		if (0 <= k and k < 254000000) {
			if (dp[k]) {
				cout << 1 << endl;
				continue;
			}
		}
		cout << 0 << endl;
	}
}