#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;

const int B = 200;
const ll MOD = 100003;
ll inv[MOD + 10];

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, vector<ll> &A) {
    for(int i = 0; i < N; ++ i)
        A[i] = xor128() % 100003;
}

int main(){
    inv[1] = 1;
    for(int i=2;i<MOD;i++){
        inv[i] = inv[MOD % i] * (MOD - MOD / i) % MOD;
    }
    
    int N, Q;
    cin >> N >> Q;
    
    vector<ll> A(N);
    generateA(N, A);
    
    vector<bool> exist(MOD + 10, false);
    for(ll a : A)exist[a] = true;
    
    vector<ll> res(MOD + 10);
    res[0] = 0;
    
    for(ll q=1;q<MOD;q++){
        ll ans = -1;
        for(ll qa=MOD-1,itr=0;qa>=0 && itr < B;qa--, itr++){
            ll a = qa * inv[q] % MOD;
            if(exist[a]){
                ans = qa;
                break;
            }
        }
        if(ans == -1){
            for(ll a : A){
                ans = max(ans, q * a % MOD);
            }
        }
        
        res[q] = ans;
    }
    
    for(int i=0;i<Q;i++){
        int q;
        cin >> q;
        
        cout << res[q] << endl;
    }
    
    return 0;
}