#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include<cstdio>
#include<algorithm>
#include<vector>
#include<iostream>
#include<queue>
#include<stack>
#include<cstring>
#include<string>
#include<map>
#include<set>
#include<sstream>
#include<bitset>
#include<numeric>
#include<climits>
#include<complex>
using namespace std;

typedef long long ll;

template<typename A,typename B>inline void chmin(A &a, B b) { if (a > b)a = b; }
template<typename A,typename B>inline void chmax(A &a, B b) { if (a < b)a = b; }

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[]) {
	for (int i = 0; i < N; ++i)
		A[i] = xor128() % 100003;
}

const int mod = 100003;

ll modpow(ll n, int m) {
	ll ret = 1;
	while (m) {
		if (m & 1)ret = ret*n%mod;
		n = n*n%mod;
		m >>= 1;
	}
	return ret;
}

int N, Q;
int A[100003];

ll inv[100003];
bool is_exist[100003];

int main() {
	for (int i = 1; i < 100003; i++)inv[i] = modpow(i, mod - 2);

	scanf("%d%d", &N, &Q);
	generateA(N, A);
	if (N <= 450) {
		while (Q--) {
			int q;
			scanf("%d", &q);
			int ans = 0;
			for (int i = 0; i < N; i++)chmax(ans, (ll)A[i] * q%mod);
			printf("%d\n", ans);
		}
	}
	else{
		for (int i = 0; i < N; i++)is_exist[A[i]] = true;

		while (Q--) {
			int q;
			scanf("%d", &q);
			if (q == 0) {
				puts("0");
				continue;
			}
			for (int i = mod - 1; i >= 0; i--) {
				int qq = (ll)i*inv[q] % mod;
				if (is_exist[qq]) {
					printf("%d\n", i);
					break;
				}
			}
		}
	}
	return 0;
}