mod = 100003

xor128_x = 123456789
xor128_y = 362436069
xor128_z = 521288629
xor128_w = 88675123

def xor128():
    global xor128_x, xor128_y, xor128_z, xor128_w
    t = (xor128_x ^ ((xor128_x << 11) & 0xFFFFFFFF)) & 0xFFFFFFFF
    xor128_x = xor128_y
    xor128_y = xor128_z
    xor128_z = xor128_w
    t ^= (t >> 8)
    temp = (xor128_w ^ (xor128_w >> 19)) & 0xFFFFFFFF
    xor128_w = (temp ^ t) & 0xFFFFFFFF
    return xor128_w

def generateA(N):
    A = []
    for _ in range(N):
        a = xor128() % mod
        A.append(a)
    return A

def main():
    import sys
    input = sys.stdin.read().split()
    ptr = 0
    N = int(input[ptr])
    ptr += 1
    Q = int(input[ptr])
    ptr += 1
    queries = []
    for _ in range(Q):
        q = int(input[ptr])
        ptr += 1
        queries.append(q)
    
    A = generateA(N)
    A_set = set(A)
    
    for q in queries:
        if q == 0:
            print(0)
            continue
        inv_q = pow(q, mod - 2, mod)
        found = False
        for m in range(mod - 1, -1, -1):
            a_candidate = (m * inv_q) % mod
            if a_candidate in A_set:
                print(m)
                found = True
                break
        if not found:
            print(0)

if __name__ == "__main__":
    main()