def main():
    import sys
    input = sys.stdin.read().split()
    ptr = 0

    N = int(input[ptr])
    ptr += 1
    K = int(input[ptr])
    ptr += 1

    A = list(map(int, input[ptr:ptr+N]))
    ptr += N

    Q = int(input[ptr])
    ptr += 1

    queries = []
    for _ in range(Q):
        x = int(input[ptr]) - 1  # 0-based index
        ptr += 1
        v = int(input[ptr])
        ptr += 1
        queries.append((x, v))

    results = []

    for x, v in queries:
        A[x] = v

        # Compute subset sum up to K
        max_sum = K
        dp = [False] * (max_sum + 1)
        dp[0] = True

        for a in A:
            if a == 0:
                continue
            if a > max_sum:
                continue
            # Iterate in reverse to avoid reusing the same element multiple times
            for s in range(max_sum, a - 1, -1):
                if dp[s - a]:
                    dp[s] = True

        results.append(1 if dp[K] else 0)

    for res in results:
        print(res)

if __name__ == '__main__':
    main()