#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
typedef pair<ll,ll> P;
#define Mod 1000000007
using VP = vector<P>; using VVP = vector<VP>;
using VI = vector<ll>; using VVI = vector<VI>; using VVVI = vector<VVI>;
#define INF 1ll<<59

ll n,k;
vector<ll> c(30020,0);

int main(){
    ll i,j;
    cin>>n>>k;
    ll a[n];
    for(i=0;i<n;i++){
        cin>>a[i];
    }
    c[0]=1;
    for(i=0;i<n;i++){
        for(j=30010;j>=0;j--){
            if(j>=a[i]) c[j]+=c[j-a[i]];
        }
    }
    ll q;
    cin>>q;
    for(i=0;i<q;i++){
        ll x,v;
        cin>>x>>v;
        x--;
        ll u=a[x];
        if(u!=0){ 
            for(j=0;j<=30010;j++){
                if(j>=u) c[j]=c[j]-c[j-u];
                if(c[j]<0) {
                    while(1) k++;
                }
            }
        }
        else{
           for(j=0;j<=30010;j++){
               c[j]=c[j]/2;
            } 
        }

        if(v!=0){
            for(j=30010;j>=0;j--){
                if(j>=v) c[j]+=c[j-v];
            }
        }
        else {
            for(j=30010;j>=0;j--){
                c[j]=2*c[j];
            }
        }
        if(c[k]>0) cout<<1<<endl;
        else cout<<0<<endl;
        a[x]=v;
        //for(j=0;j<=15010;j++){
        //    if(c[j]>0) cout<<j<<" "<<c[j]<<endl;
        //}
        //cout<<endl;
    }
    

    return 0;
}