#include <bitset>
#include <vector>
#include <iostream>

using namespace std;

int main() {
    int N, K;
    cin >> N >> K;
    
    vector<int> A(N);
    for (int i = 0; i < N; ++i) {
        cin >> A[i];
    }
    
    int Q;
    cin >> Q;
    
    for (int q = 0; q < Q; ++q) {
        int x, v;
        cin >> x >> v;
        x--; // convert to 0-based index
        A[x] = v;
        
        // Collect all elements <= K
        vector<int> elements;
        for (int a : A) {
            if (a <= K) {
                elements.push_back(a);
            }
        }
        
        // Compute subset sum using bitset
        bitset<15001> dp;
        dp.set(0);
        for (int a : elements) {
            if (a > K) continue;
            dp |= dp << a;
        }
        
        if (dp[K]) {
            cout << "1\n";
        } else {
            cout << "0\n";
        }
    }
    
    return 0;
}