#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
#define RT return
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;

const int M1 = 998244353, M2 = 1000000007;
void sadd(pii &a, pii b) {
    a.first += b.first;
    a.second += b.second;
    if (a.first < 0)a.first += M1;
    if (a.second < 0)a.second += M2;
    if (a.first >= M1)a.first -= M1;
    if (a.second >= M2)a.second -= M2;
}

void solve() {
    int N, K;
    cin >> N >> K;
    const int MA = 30000;
    vector<pii> dp(MA);
    dp[0] = mp(1, 1);
    vi A(N);
    rep(i, N) {
        cin >> A[i];
        for (int j = MA - 1; j >= A[i]; --j) {
            sadd(dp[j], dp[j - A[i]]);
        }
    }

    int Q;
    cin >> Q;
    rep(i, Q) {
        int id, val;
        cin >> id >> val;
        --id;
        if (A[id] > 0) {
            for (int j = A[id]; j < MA; ++j) {
                pii x = dp[j - A[id]];
                sadd(dp[j], { -x.first,-x.second });
            }
        }
        A[id] = val;
        if (A[id] > 0) {
            for (int j = MA - 1; j >= A[id]; --j) {
                sadd(dp[j], dp[j - A[id]]);
            }
        }
        cout << (dp[K].first || dp[K].second ? 1 : 0) << endl;
    }
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(15);
	solve();
	return 0;
}