// includes #include // macros #define ll long long int #define pb emplace_back #define mk make_pair #define pq priority_queue #define FOR(i, a, b) for(int i=(a);i<(b);++i) #define rep(i, n) FOR(i, 0, n) #define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--) #define all(x) (x).begin(),(x).end() #define sz(x) ((int)(x).size()) #define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end()) #define FI first #define SE second using namespace std; // types typedef pair P; typedef pair Pl; typedef pair Pll; typedef pair Pd; // constants const int inf = 1e9; const ll linf = 1LL << 50; const double EPS = 1e-10; const int mod = 100003; // solve template bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;} template bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;} template istream &operator>>(istream &is, vector &vec){for(auto &v: vec)is >> v; return is;} 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)); } template T power(T a, T n, T mod) { T res = 1; T tmp = n; T curr = a; while(tmp){ if(tmp % 2 == 1){ res = (T)((ll)res * curr % mod); } curr = (T)((ll)curr * curr % mod); tmp >>= 1; } return res; } int main(int argc, char const* argv[]) { ios_base::sync_with_stdio(false); cin.tie(0); int n, q; cin >> n >> q; vector a(n); rep(i, n)a[i] = xor128() % mod; vector b(100004, false); rep(i, n)b[a[i]] = true; rep(i, q){ int x; cin >> x; ll inv = power(x, mod - 2, mod); for(int i = 100002; i >= 0; i--){ if(b[(i * inv) % mod]){ cout << i << endl; break; } } } return 0; }