def main():
    import sys
    input = sys.stdin.read().split()
    idx = 0
    N = int(input[idx])
    idx += 1
    Q = int(input[idx])
    idx += 1
    queries = list(map(int, input[idx:idx+Q]))
    
    # Initialize xor128 variables
    xor128_x, xor128_y, xor128_z, xor128_w = 123456789, 362436069, 521288629, 88675123
    
    def xor128():
        nonlocal xor128_x, xor128_y, xor128_z, xor128_w
        t = xor128_x ^ ((xor128_x << 11) & 0xFFFFFFFF)
        t = t & 0xFFFFFFFF
        xor128_x, xor128_y, xor128_z = xor128_y, xor128_z, xor128_w
        t2 = (xor128_w ^ ((xor128_w >> 19) & 0xFFFFFFFF)) ^ (t ^ ((t >> 8) & 0xFFFFFFFF))
        t2 = t2 & 0xFFFFFFFF
        xor128_w = t2
        return xor128_w
    
    # Generate A
    A = []
    for _ in range(N):
        val = xor128() % 100003
        A.append(val)
    
    # Create exist array
    exist = [False] * 100003
    for a in A:
        exist[a] = True
    
    MOD = 100003
    for q in queries:
        if q == 0:
            print(0)
            continue
        # Compute inverse of q modulo MOD
        inv_q = pow(q, MOD-2, MOD)
        found = False
        for m in range(MOD-1, -1, -1):
            r = (m * inv_q) % MOD
            if exist[r]:
                print(m)
                found = True
                break
        if not found:
            print(0)  # This case should not happen since q is non-zero and MOD is prime

if __name__ == "__main__":
    main()