#include <bits/stdc++.h>
#define int long long
#define _ (__int128)
using namespace std;
const int N = 500005;
int n, m, q, mod, c[N], d[N];
__int128 a[N], b[N];
int exgcd(int x, int y, int &A, int &B){
	if(!y) return A = 1, B = 0, x;
	int ans = exgcd(y, x % y, B, A);
	B -= x / y * A; return ans;
}
__int128 gcd(__int128 x, __int128 y){
	if(!y) return x;
	return gcd(y, x % y);
}
signed main(){
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cin >> n >> m;
	for(int i = 1; i <= n; i++) cin >> c[i];
	for(int i = 1; i <= m; i++) cin >> d[i];
	for(int i = 1; i <= n; i += 2){
		a[(i + 1) / 2] = 1;
		for(int j = i; j <= min(n, i + 1); j++) a[(i + 1) / 2] *= c[j];
	}
	for(int i = 1; i <= m; i += 2){
		b[(i + 1) / 2] = 1;
		for(int j = i; j <= min(n, i + 1); j++) b[(i + 1) / 2] *= d[j];
	}
	n = (n + 1) / 2, m = (m + 1) / 2;
	for(int i = 1; i <= n; i++) for(int j = 1; j <= m; j++){
		int t = gcd(a[i], b[j]);
		a[i] /= t, b[j] /= t;
	}
	cin >> q;
	while(q--){
		cin >> mod;
		int p1 = 1, p2 = 1;
		for(int i = 1; i <= n; i++) p1 = _(1) * p1 * (a[i] % mod) % mod;
		for(int i = 1; i <= m; i++) p2 = _(1) * p2 * (b[i] % mod) % mod;
		if(!p2 || __gcd(p2, mod) != 1) cout << "DIVISION BY ZERO\n";
		else{
			int A, B; exgcd(p2, mod, A, B);
			A = (A % mod + mod) % mod;
			cout << (int)(_(1) * p1 * A % mod) << '\n';
		}
	}
	return 0;
}