import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
# md = 10**9+7
# md = 998244353

md = 100003
xor128_x = 123456789
xor128_y = 362436069
xor128_z = 521288629
xor128_w = 88675123
mask = (1 << 32)-1

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

n, q = LI()
aa = set(xor128()%md for _ in range(n))
n = len(aa)

if n**3 < md*q:
    for _ in range(q):
        b = II()
        ans = 0
        if b%md:
            for a in aa:
                v = a*b%md
                if v > ans: ans = v
        print(ans)

else:
    for _ in range(q):
        b = II()
        if b%md == 0:
            print(0)
        else:
            b = pow(b, md-2, md)
            for ans in range(md)[::-1]:
                a = ans*b%md
                if a in aa:
                    print(ans)
                    break