#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
#include <bitset>
#include <iomanip>
#include <sys/time.h>
#include <random>
using namespace std;

#define endl '\n'
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define UNIQ(v) (v).erase(unique((v).begin(), (v).end()), (v).end())

typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef complex<double> comp;
typedef vector< vector<ld> > matrix;
struct pairhash {
public:
    template<typename T, typename U>
    size_t operator()(const pair<T, U> &x) const {
	size_t seed = hash<T>()(x.first);
	return hash<U>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
    }
};
const int inf = 1e9 + 9;
const ll mod = 1e5 + 3;
const double eps = 1e-8;
const double pi = acos(-1);

int n, Q;
ll a[100100];
ll q[100100];

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));
}

ll gen() {
    return xor128() % mod;
}

ll mod_pow(ll x, ll n) {
    ll res = 1;
    while (n > 0) {
        if (n & 1) res = (res * x) % mod;
        x = (x * x) % mod;
        n >>= 1;
    }
    return res;
}

ll mod_inverse(ll x) {
    return mod_pow(x, mod-2);
}

void solve1() {
    for (int i = 0; i < Q; i++) {
        ll res = 0;
        for (int j = 0; j < n; j++) {
            res = max(res, a[j] * q[i] % mod);
        }
        cout << res << endl;
    }
}

void solve2() {
    bool e[mod];
    memset(e, false, sizeof(e));
    for (int i = 0; i < n; i++) e[a[i]] = true;
    for (int i = 0; i < Q; i++) {
        if (q[i] == 0) cout << 0 << endl;
        else {
            for (ll j = mod-1; j > 0; j--) {
                if (e[j*mod_inverse(q[i])%mod]) {
                    cout << j << endl;
                    break;
                }
            }
        }
    }
}

void input() {
    cin >> n >> Q;
    for (int i = 0; i < Q; i++) cin >> q[i];
    for (int i = 0; i < n; i++) a[i] = gen();
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(15);

    input();
    if (n < 5000) solve1();
    else solve2();
}