#include <bits/stdc++.h>
using namespace std;
const long long 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));
}
void generateA(int N, int A[]) {
    for (int i = 0; i < N; ++i)
        A[i] = xor128() % 100003;
}

int main() {
    int N, Q, A[100010] = {};
    cin >> N >> Q;
    generateA(N, A);

    sort(A, A + N);
    int cnt[100010] = {};
    for (int i = 0; i < N; i++) {
        cnt[A[i]] = 1;
    }

    auto modpow = [&](long long a, int n) {
        long long t = 1;
        while (n) {
            if (n & 1)
                (t *= a) %= mod;
            (a *= a) %= mod;
            n >>= 1;
        }
        return t;
    };


    while (Q--) {
        long long q;
        cin >> q;
        if (q == 0) {
            cout << A[N - 1] << endl;
            continue;
        }
        long long ans = 0;
        if (N < 3333) {
            for (int i = 0; i < N; i++) {
                ans = max(ans, (A[i] * q) % mod);
            }
        } else {
            for (int i = mod - 1; i >= 0; i--) {
                if (cnt[(modpow(q, mod - 2) * i) % mod]) {
                    ans = i;
                    break;
                }
            }
        }
        cout << ans << endl;
    }
}