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

//入力が必ず-mod<a<modの時.
template<const int mod>
struct modint{ //mod変更が不可能.
    public:
    long long v = 0;
    static void setmod(int m){} //飾り.
    static constexpr long long getmod(){return mod;}
    modint(){v = 0;} modint(int a){v = a<0?a+mod:a;} modint(long long a){v = a<0?a+mod:a;}
    modint(unsigned int a){v = a;} modint(unsigned long long a){v = a;}
    long long val()const{return v;}
 
    modint &operator=(const modint &b) = default;
    modint operator+()const{return (*this);}
    modint operator-()const{return modint(0)-(*this);}
    modint operator+(const modint b)const{return modint(v)+=b;}
    modint operator-(const modint b)const{return modint(v)-=b;}
    modint operator*(const modint b)const{return modint(v)*=b;}
    modint operator/(const modint b)const{return modint(v)/=b;}
    modint operator+=(const modint b){
        v += b.v; if(v >= mod) v -= mod;
        return *this;
    }
    modint operator-=(const modint b){
        v -= b.v; if(v < 0) v += mod; 
        return *this;
    }   
    modint operator*=(const modint b){v = v*b.v%mod; return *this;}
    modint operator/=(modint b){ //b!=0 mod素数が必須.
        if(b == 0) assert(false);
        int left = mod-2;
        while(left){if(left&1) *this *= b; b *= b; left >>= 1;}
        return *this;
    }
    modint operator++(){*this += 1; return *this;}
    modint operator--(){*this -= 1; return *this;}
    modint operator++(int){*this += 1; return *this;}
    modint operator--(int){*this -= 1; return *this;}
    bool operator==(const modint b)const{return v == b.v;}
    bool operator!=(const modint b)const{return v != b.v;}
    bool operator>(const modint b)const{return v > b.v;}
    bool operator>=(const modint b)const{return v >= b.v;}
    bool operator<(const modint b)const{return v < b.v;}
    bool operator<=(const modint b)const{return v <= b.v;}
    modint pow(long long n)const{
        modint ret = 1,p = v;
        if(n < 0) p = p.inv(),n = -n;
        while(n){
            if(n&1) ret *= p;
            p *= p; n >>= 1;
        }
        return ret;
    }
    modint inv()const{return modint(1)/v;} //素数mod必須.
};
using mint = modint<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, mint A[]) {
    for(int i = 0; i < N; ++ i)
        A[i] = xor128() % 100003;
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    mint A[100003];
    int N,Q; cin >> N >> Q;
    generateA(N,A);   
    const int mod = 100003;

    if(N <= 1000){
        while(Q--){
            long long a; cin >> a;
            if(a == 0){cout << "0\n"; continue;}
            long long answer = 0;
            for(int i=0; i<N; i++) answer = max(answer,(A[i]*a).v);
            cout << answer << "\n";
        }        
    }
    else{
        int Limit = 100002; //Limit->必要なサイズ fac->x! facinv->1/x! inv->1/x.
        vector<mint> fac(Limit+1,1),facinv(Limit+1);
        {
            int mod = mint::getmod(),invstart = min(mod-1,Limit); 
            for(int i=1; i<=Limit; i++) fac.at(i) = fac.at(i-1)*i;
            facinv.at(invstart) = fac.at(invstart).inv();
            for(int i=invstart-1; i>=0; i--) facinv.at(i) = facinv.at(i+1)*(i+1);
        }
        vector<mint> inv(Limit+1); for(int i=1; i<=Limit; i++) inv.at(i) = fac.at(i-1)*facinv.at(i); //必要なら解放.
        auto nCr = [&](int n,int r) -> mint {
            if(n < r || r < 0 || n < 0) return 0;
            return fac.at(n)*facinv.at(r)*facinv.at(n-r);
        };
        vector<bool> OK(100003);
        for(int i=0; i<N; i++) OK.at(A[i].v) = true; 
        while(Q--){
            long long a; cin >> a;
            if(a == 0){cout << "0\n"; continue;}
            mint aa = inv.at(a);
            for(int i=100002; i>=0; i--) if(OK.at((aa*i).v)){cout << i << "\n"; break;}
        }
    }
}