// yukicoder: 97 最大の値を求めるくえり
// 2019.5.6 bal4u

#include <stdio.h>
#include <stdlib.h>

#if 1
#define gc() getchar_unlocked()
#define pc(c) putchar_unlocked(c)
#else
#define gc() getchar()
#define pc(c) putchar(c)
#endif
int in()   // 整数の入力（負数対応）
{
	int n = 0, c = gc();
	do n = 10*n + (c & 0xf), c = gc(); while (c >= '0');
	return n;
}

void out(int n)  // 非負整数の表示（出力）
{
	int i;
	char b[20];

	if (!n) pc('0');
	else {
		i = 0; while (n) b[i++] = n % 10 + '0', n /= 10;
		while (i--) pc(b[i]);
	}
}

unsigned x = 123456789, y = 362436069, z = 521288629, w = 88675123;
unsigned xor128() {
	unsigned t = x ^ (x << 11);
	x = y, y = z, z = w;
	return w = w ^ (w >> 19) ^ (t ^ (t >> 8));
}

#define M 100003
#define MAX M
int inv[MAX+10];
int a[MAX+10]; int N;

void generateA() {
	int i = N; while (i--) a[i] = (int)(xor128() % M);
}

int cmp(const void *a, const void *b) { return *(int *)a - *(int *)b; }

int bsch(int x) {
	int l = 0, r = N, m, ans;
	while (l < r) {
		m = (l + r) >> 1;
		if (a[m] <= x) l = m+1; else r = m;
	}
	if (l <= 0) ans = a[0];
	else ans = a[l-1];
	if (ans == 0) {
		int i; for (i = 0; ; i++) if (a[i]) { ans = a[i]; break; }
	}
	return ans;
}

int main()
{
	int i, Q, q;
	
	inv[1] = 1; for (i = 2; i <= MAX; i++) {
		inv[i] = (M + (-(M/i)*(long long)inv[M % i]) % M) % M;
	}

	N = in(), Q = in();
	generateA();
	qsort(a, N, sizeof(int), cmp);
	
	while (Q--) {
		q = in();
		if (q == 0) pc('0');
		else out((q * (long long)bsch(((M-1) * (long long)inv[q]) % M)) % M);
		pc('\n');
	}
	return 0;
}