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

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

typedef long long ll;

#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];

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

static 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+5] = {1,1};
int a[MAX+5]; int N;
char f[MAX+5];

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

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

	N = in(), Q = in();

	if (N <= 500) {
		generateA();
		while (Q--) {
			q = in();
			if (q == 0) pc('0');
            else {
				ans = 0, i = N; while (i--) {
					int t = (ll)q*a[i] % M;
					if (t > ans) ans = t;
				}
				out(ans);
			}
			pc('\n');
        }
	} else {
		generateB();
		while (Q--) {
			q = in();
			if (q == 0) pc('0');
			else {
				for (i = M-1; !f[i*(ll)inv[q] % M]; i--);
				out(i);
			}
			pc('\n');
		}
	}
	return 0;
}