#include <iostream>
#include <algorithm>
using namespace std;
const int mod = 100003;
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));
}
int N, Q, x, A[100009], inv[100009]; bool f[100009];
int main() {
	cin.tie(0);
	ios_base::sync_with_stdio(false);
	inv[1] = 1;
	for (int i = 2; i < mod; ++i) inv[i] = 1LL * inv[mod % i] * (mod - mod / i) % mod;
	cin >> N >> Q;
	for (int i = 0; i < N; ++i) A[i] = xor128() % mod, f[A[i]] = true;
	for (int i = 0; i < Q; ++i) {
		cin >> x;
		int mx = -1;
		if (x == 0) mx = 0;
		else if (N <= 250) {
			for (int j = 0; j < N; ++j) {
				mx = max(mx, (int)(1LL * A[j] * x % mod));
			}
		}
		else {
			x = inv[x];
			int s = 0;
			for (int j = mod - 1; j >= 0; --j) {
				if (f[s = (s < x ? s - x + mod : s - x)]) {
					mx = j; break;
				}
			}
		}
		cout << mx << '\n';
	}
	return 0;
}