import core.thread;
import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.range, std.regex;

//	Input
class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { tokens = readln.split; if (tokens.empty && stdin.eof) throw new EOFException; } auto token = tokens[0]; tokens.popFront; return token; }
int readInt() { return to!int(readToken); }
long readLong() { return to!long(readToken); }
real readReal() { return to!real(readToken); }

//	chmin/chmax
void chmin(T)(ref T t, in T f) { if (t > f) t = f; }
void chmax(T)(ref T t, in T f) { if (t < f) t = f; }

//	Pair
struct Pair(S, T) {
	S x; T y;
	int opCmp(    const Pair p) const { return (x < p.x) ? -1 : (x > p.x) ? +1 : (y < p.y) ? -1 : (y > p.y) ? +1 : 0; }
	int opCmp(ref const Pair p) const { return (x < p.x) ? -1 : (x > p.x) ? +1 : (y < p.y) ? -1 : (y > p.y) ? +1 : 0; }
	string toString() const { return "(" ~ to!string(x) ~ ", " ~ to!string(y) ~ ")"; }
}
auto pair(S, T)(inout(S) x, inout(T) y) { return Pair!(S, T)(x, y); }

//	Array
int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = as.length; for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) { return (a <  val); }); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) { return (a <= val); }); }
T[] unique(T)(in T[] as) { T[] bs; foreach (a; as) if (bs.empty || bs[$ - 1] != a) bs ~= a; return bs; }


immutable MO = 100003;
long[] inv;

int N, Q;
long[] A;

void main(string[] args) {
	inv = new long[MO];
	inv[1] = 1;
	foreach (i; 2 .. MO) {
		inv[i] = MO - MO / i * inv[MO % i] % MO;
	}
	
	try {
	for (; ; ) {
		N = readInt;
		A = new long[N];
		{
			alias unsigned = uint;
			unsigned xor128_x = 123456789, xor128_y = 362436069, xor128_z = 521288629, xor128_w = 88675123;
			unsigned xor128() {
				unsigned t = xor128_x ^ (xor128_x << 11);
				xor128_x = xor128_y; xor128_y = xor128_z; xor128_z = xor128_w;
				return xor128_w = xor128_w ^ (xor128_w >> 19) ^ (t ^ (t >> 8));
			}
			// void generateA(int N, int A[]) {
			void generateA(int N, long A[]) {
				for(int i = 0; i < N; ++ i)
					A[i] = xor128() % 100003;
			}
			generateA(N, A);
		}
		
		bool[] has = new bool[MO];
		foreach (i; 0 .. N) {
			has[cast(size_t)(A[i])] = true;
		}
		
		foreach (tc; 0 .. readInt) {
			const q = readLong;
			long ans;
			if (q == 0) {
				ans = 0;
			} else if (N <= MO / N) {
				foreach (i; 0 .. N) {
					chmax(ans, (A[i] * q) % MO);
				}
			} else {
				foreach_reverse (x; 0 .. MO) {
					if (has[cast(size_t)((x * inv[cast(size_t)(q)]) % MO)]) {
						ans = x;
						break;
					}
				}
			}
			writeln(ans);
		}
		
	}
	} catch (EOFException) {}
}