#include #include #include #include #include #include #include #include #include #include #include static const int MOD = 1000000009; using ll = long long; using u32 = uint32_t; using namespace std; template constexpr T INF = ::numeric_limits::max()/32*15+208; template vector make_v(U size, const T& init){ return vector(static_cast(size), init); } template auto make_v(U size, Ts... rest) { return vector(static_cast(size), make_v(rest...)); } template void chmin(T &a, const T &b){ a = (a < b ? a : b); } template void chmax(T &a, const T &b){ a = (a > b ? a : b); } template struct modint{ ll val; modint(): val(0){} template explicit modint(T t){val = t%M; if(val < 0) val += M;} modint pow(ll k){ modint res(1), x(val); while(k){ if(k&1) res *= x; x *= x; k >>= 1; } return res; } template modint& operator=(T a){ val = a%M; if(val < 0) val += M; return *this; } modint inv() {return pow(M-2);} modint& operator+=(modint a){ val += a.val; if(val >= M) val -= M; return *this;} modint& operator-=(modint a){ val += M-a.val; if(val >= M) val -= M; return *this;} modint& operator*=(modint a){ val = 1LL*val*a.val%M; return *this;} modint& operator/=(modint a){ return (*this) *= a.inv();} modint operator+(modint a) const {return modint(val) +=a;} modint operator-(modint a) const {return modint(val) -=a;} modint operator*(modint a) const {return modint(val) *=a;} modint operator/(modint a) const {return modint(val) /=a;} modint operator-(){ return modint(-val);} bool operator==(const modint a) const {return val == a.val;} bool operator!=(const modint a) const {return val != a.val;} bool operator<(const modint a) const {return val < a.val;} }; using mint = modint; int main() { int n, k; cin >> n >> k; vector v(n); for (auto &&i : v) scanf("%d", &i); auto dp = make_v(2, k+1, mint(0)); dp[0][0] = mint(1); for (int i = 1; i <= n; ++i) { int now = i&1, prv = now^1; for (int j = 0; j <= k; ++j) { dp[now][j] = dp[prv][j]; if(j >= v[i-1]) dp[now][j] += dp[prv][j-v[i-1]]; } } auto DP = dp[n%2]; int q; cin >> q; for (int i = 0; i < q; ++i) { int x, u; scanf("%d %d", &x, &u); vector newdp(DP); x--; if(v[x] == 0){ for (int j = 0; j <= k; ++j) { newdp[j] = DP[j] * mint(500000005); } }else { for (int j = v[x]; j <= k; ++j) { newdp[j] -= newdp[j-v[x]]; } } for (int j = 0; j <= k; ++j) { DP[j] = newdp[j]; if(j >= u) DP[j] += newdp[j-u]; } v[x] = u; printf("%d\n", DP[k] != mint(0)); } return 0; }