#include <bits/stdc++.h>
using namespace std;
using ll = long long;

ll extgcd(ll a, ll b, ll& x, ll& y) {
	if (b == 0) {
		x = (a >= 0) ? 1 : -1;
		y = 0;
		return abs(a);
	}
	else {
		ll res = extgcd(b, a % b, y, x);
		y -= (a / b) * x;
		return res;
	}
}

ll mod_inverse(ll a, ll m) {
	ll x, y;
	extgcd(a, m, x, y);
	return (m + x % m) % m;
}

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 A[100003];

void solve(){
    int N, Q; cin >> N >> Q;
    generateA(N, A);
    vector<bool> check(100003);
    for(int i=0;i<N;++i) check[A[i]]=true;

    while(Q--){
        ll q; cin>>q;
        if(q==0) cout<<0;
        else if(N<2000){
            ll maxi=0;
            for(int i=0;i<N;++i){
                maxi=max(maxi,q*A[i]%100003);
            }
            cout<<maxi;
        } else{
            ll p=mod_inverse(q,100003);
            for(int x=100003-1;;x==100002?--x:x-=2){
                if(check[p*x%100003]){
                    cout<<x;
                    break;
                }
            }
        }
        cout<<'\n';
    }
}
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t=1; //cin>>t;
    for(;t--;) solve();
}