#include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define fir first.first
#define sec first.second
#define thi second
#define mp(x, y) make_pair((x), (y))
#define mt(x, y, z) mp(mp(x, y), z)
#define pp(x, y) push(mp(x, y))
#define pbp(x, y) pb(mp(x, y))
#define pbt(x, y, z) pb(mt(x, y, z))
#define re(i, n) for (int _a = (n), i = 0; i < _a; ++i)
#define ree(i, n) for (int _a = (n), i = 1; i <= _a; ++i)
#define rep(i, l, r) for (int _a = (r), i = l; i <= _a; ++i)
#define repd(i, r, l) for (int _a = (l), i = r; i >= _a; --i)
#define re0(i, x, ni) for (int i = x; i; i = ni)
#define fe(i, x) re0(i, pnt[x], nxt[i])
#define ress(i, S) for (int _S = (S), i = _S; i; i = _S & (i - 1))
#define clr(a, n, v) { re(_i, n) a[_i] = v; }
#define sqr(x) ((x) * (x))
#define inc(x, y) { x = (1LL * x + (y)); if ((x) >= P) x -= P; }
#define mul(x, y) { x = (1LL * x * (y)) % P; }
#define dec(x, y) { x = (x - (y) % P); if (x < 0) x += P; }

#define enc(x, y) ((x - 1) * m + (y))

template<typename T> inline T abs(T x) { return x < 0 ? -x : x; }
template<typename T> inline void ma(T &x, const T y){ if (x < y) x = y; }
template<typename T> inline void mi(T &x, const T y){ if (x > y) x = y; }
// template<typename T> inline T max(const T &x, const T &y){ return x < y ? y : x; }
// template<typename T> inline T min(const T &x, const T &y){ return x > y ? y : x; }


using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<PII, int> PIII;
typedef pair<ll, ll> PLL;
typedef pair<PLL, ll> PLLL;
// typedef __int128 lll;

// #define getchar() (SB==TB&&(TB=(SB=BB)+fread(BB,1,1<<15,stdin),SB==TB)?EOF:*SB++)
// char BB[1 << 16], *SB = BB, *TB = BB;

template<typename T> inline void read(T &x) {
    int s = 1, d = getchar(); x = 0;
    for ( ;!isdigit(d); d = getchar()) if (!(d^'-')) s = -1;
    while (isdigit(d)) x = x * 10 + (d&15), d = getchar();
    x *= s;
}
template<typename T, typename...L> inline void read(T &x, L &...l) { read(x), read(l...); }

inline int gi() { int x; read(x); return x; }

template<class T> void write(T x) {
    if (x < 0) { putchar('-'); x = -x; }
    if (x > 9) write(x / 10); putchar(x % 10 + '0');
}

int mex(const set<int> &s) {
    int l = -1;
    for (auto i : s) {
        if (i - l > 1) return l + 1;
        l = i;
    }
    return l + 1;
}

int P = 998244353;

template<typename T>
T qpow(T a, T b) {
	T r = 1;
	while (b) {
		if (b&1) r = 1LL * r * a % P;
		a = 1LL * a * a % P; b >>= 1;
	}
	return r;
}

const int T = 1e2 + 10;
const int N1e7 = 1e7 + 10;
const int N1e6 = 1e6 + 10;
const int N5e5 = 5e5 + 10;
const int N5e3 = 5e3 + 10;
const int N8e2 = 8e2 + 10;
const int N1e2 = 1e2 + 10;
const int N50 = 50 + 10;
const int M = 8e5 + 10;
const int K = 3e2 + 10;
const int LG = 20;
// const int S = 1 << N;
const ll inf = ~0ULL>>2;
const long long infll = ~0ULL>>1; 
const double eps = 1e-9;
const int dx[] = {0, 0, 1, -1};
const int dy[] = {1, -1, 0, 0};

//random_device rd;
//mt19937 g(rd());
//int randi(int x) { return g() % x; }

const int N = N5e3;
const int Q = N * 2;

int n, m;
ll a[N], b[N];

ll gcd(ll a, ll b) {
    return b ? gcd(b, a % b) : a;
}

ll exgcd(ll a, ll b, ll &x, ll &y) {
    if (!b) {
        x = 1, y = 0;
        return a;
    }
    ll d = exgcd(b, a % b, y, x);
    y -= a / b * x;
    return d;
}

ll inv(ll a, ll p) {
    ll x, y;
    exgcd(a, p, x, y);
    return (x % p + p) % p;
}

void solve() {
	read(n, m);
    re(i, n) read(a[i]);
    re(i, m) {
        read(b[i]);
        re(j, n) {
            ll x = gcd(a[j], b[i]);
            a[j] /= x, b[i] /= x;
        }
    }
    int q = gi();
    while (q--) {
        ll mod; read(mod);
        ll r = 1, f = 0, den = 1; re(i, n) r = (__int128)r * a[i] % mod;
        re(i, m) {
            ll x = gcd(mod, b[i]);
            if (x == 1) {
                den = (__int128)den * b[i] % mod;
            } else {
                f = 1;
                break;
            }
        }
        if (f) cout << "DIVISION BY ZERO\n";
        else cout << ll((__int128)r * inv(den, mod) % mod) << '\n';
    }
}

int main() {
	// freopen("in", "r", stdin);
    int t = 1;
	// t = gi();
	while (t--) solve();
}