#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;

using ull = unsigned long long;
ull dp[1<<15];

int main(){
    int n,k;
    cin>>n>>k;
    dp[0]=1;
    int a[n];
    rep(i,n){
        cin>>a[i];
        if(a[i]==0)continue;
        for(int j = 1<<14;j>=0;--j){
            dp[j+a[i]]+=dp[j];
        }
    }
    int q;
    cin>>q;
    while(q--){
        int x,v;
        cin>>x>>v;
        --x;
        if(a[x]){
        for(int j = 0;j<=k;++j){
            dp[j+a[x]]-=dp[j];
        }
        }
        a[x]=v;
        if(v){
        for(int j = 1<<14;j>=0;--j){
            dp[j+v]+=dp[j];
        }
        }
        cout<<!!dp[k]<<endl;
    }
    return 0;
}