#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

const int prime_max = 1000000;
vector<int> prime;
int NP,divp[prime_max];

void cprime() {
	if(NP) return;
	for(int i=2;i<prime_max;i++) if(divp[i]==0) {
		//M[i]=NP;
		prime.push_back(i); NP++;
		for(ll j=1LL*i*i;j>=i&&j<prime_max;j+=i) if(divp[j]==0) divp[j]=i;
	}
}

int N,K;
int A[151515];
const int DI=125;
int ok[DI][15151];
ll dp[15151][2];
ll mo[2]={1000000007,1000000009};
int Q;
void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cprime();
	
	cin>>N>>K;
	dp[0][0]=dp[0][1]=1;
	FOR(i,N) {
		cin>>A[i];
		if(A[i]) {
			for(x=15000-A[i];x>=0;x--) {
				(dp[x+A[i]][0]+=dp[x][0]*prime[i])%=mo[0];
				(dp[x+A[i]][1]+=dp[x][1]*prime[i])%=mo[1];
			}
		}
	}
	
	cin>>Q;
	while(Q--) {
		cin>>i>>y;
		i--;
		if(A[i]) {
			FOR(x,15000-A[i]+1) {
				(dp[x+A[i]][0]-=dp[x][0]*prime[i])%=mo[0];
				(dp[x+A[i]][1]-=dp[x][1]*prime[i])%=mo[1];
			}
		}
		A[i]=y;
		if(A[i]) {
			for(x=15000-A[i];x>=0;x--) {
				(dp[x+A[i]][0]+=dp[x][0]*prime[i])%=mo[0];
				(dp[x+A[i]][1]+=dp[x][1]*prime[i])%=mo[1];
			}
		}
		if(dp[K][0] && dp[K][1]) cout<<1<<endl;
		else cout<<0<<endl;
		
	}
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}