#include #define GET_MACRO(a, b, c, NAME, ...) NAME #define rep(...) GET_MACRO(__VA_ARGS__, rep3, rep2)(__VA_ARGS__) #define rep2(i, a) rep3 (i, 0, a) #define rep3(i, a, b) for (int i = (a); i < (b); i++) #define repr(...) GET_MACRO(__VA_ARGS__, repr3, repr2)(__VA_ARGS__) #define repr2(i, a) repr3 (i, 0, a) #define repr3(i, a, b) for (int i = (b) - 1; i >= (a); i--) #define chmin(a, b) ((b) < a && (a = (b), true)) #define chmax(a, b) (a < (b) && (a = (b), true)) using namespace std; typedef long long ll; const ll mod = 100003; ll A[101010]; ll B[101010]; 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, ll A[]) { for(int i = 0; i < N; ++ i) A[i] = xor128() % 100003; } ll modpow(ll a, ll b, ll mod) { ll res = 1; while (b) { if (b & 1) (res *= a) %= mod; (a *= a) %= mod; b /= 2; } return res; } ll modinv(ll a, ll mod) { return modpow(a, mod - 2, mod); } int main() { int N, Q; cin >> N >> Q; generateA(N, A); rep (i, N) { B[A[i]]++; } while (Q--) { int q; scanf("%d", &q); ll inv = modinv(q, mod); repr (i, mod) { if (B[inv * i % mod]) { printf("%d\n", i); break; } } } return 0; }