#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 100000000000

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

int main(){
	int N,Q;
	cin>>N>>Q;
	
	vector<int> A(N);
	generateA(N,A);
	//cout<<A[0]<<endl;
	vector<bool> f(100003,false);
	rep(i,N){
		//cout<<A[i]<<endl;
		f[A[i]] = true;
	}
	
	int Cnt =0;
	rep(i,f.size()){
		if(f[i])Cnt++;
	}
	
	vector<int> ans(100003,-1);
	vector<int> Inv(100003,0);
	rep(i,100003){
		if(i==0)continue;
		Inv[i] = inv_mod(i,100003);
	}
	
	if(Cnt<=400){
		rep(i,f.size()){
			if(!f[i])continue;
			if(i==0)continue;
			rep(j,100003){
				long long temp = j;
				temp *= Inv[i];
				temp %= 100003;
				ans[temp] = max(ans[temp],j);
			}
		}
	}
	
	ans[0] = 0;
	rep(i,Q){
		int q;
		scanf("%d",&q);
		if(ans[q]==-1){
			for(int j=100002;j>=1;j--){
				long long t = j;
				t *= Inv[q];
				t %= 100003;
				if(f[t]){
					ans[q] = j;
					break;
				}
			}
		}
		printf("%d\n",ans[q]);
	}
		
	
	return 0;
}