#include <bits/stdc++.h>

using i64 = long long;
i64 mul(i64 a, i64 b, i64 m) {
    i64 c = a * b - i64(1.0L * a * b / m) * m;
    c %= m;
    if (c < 0) {
        c += m;
    }
    return c;
}
i64 power(i64 a, i64 b, i64 m) {
    i64 res = 1 % m;
    for (; b; b >>= 1, a = mul(a, a, m))
        if (b & 1)
            res = mul(res, a, m);
    return res;
}
bool isprime(i64 n) {
    if (n < 2)
        return false;
    static constexpr int A[] = {2, 3, 5, 7, 11, 13, 17, 19, 23};
    int s = __builtin_ctzll(n - 1);
    i64 d = (n - 1) >> s;
    for (auto a : A) {
        if (a == n)
            return true;
        i64 x = power(a, d, n);
        if (x == 1 || x == n - 1)
            continue;
        bool ok = false;
        for (int i = 0; i < s - 1; ++i) {
            x = mul(x, x, n);
            if (x == n - 1) {
                ok = true;
                break;
            }
        }
        if (!ok)
            return false;
    }
    return true;
}
std::vector<std::pair<i64, int>> factorize(i64 n) {
    std::vector<i64> p;
    std::function<void(i64)> f = [&](i64 n) {
        if (n <= 10000) {
            for (int i = 2; i * i <= n; ++i)
                for (; n % i == 0; n /= i)
                    p.push_back(i);
            if (n > 1)
                p.push_back(n);
            return;
        }
        if (isprime(n)) {
            p.push_back(n);
            return;
        }
        auto g = [&](i64 x) {
            return (mul(x, x, n) + 1) % n;
        };
        i64 x0 = 2;
        while (true) {
            i64 x = x0;
            i64 y = x0;
            i64 d = 1;
            i64 power = 1, lam = 0;
            i64 v = 1;
            while (d == 1) {
                y = g(y);
                ++lam;
                v = mul(v, std::abs(x - y), n);
                if (lam % 127 == 0) {
                    d = std::gcd(v, n);
                    v = 1;
                }
                if (power == lam) {
                    x = y;
                    power *= 2;
                    lam = 0;
                    d = std::gcd(v, n);
                    v = 1;
                }
            }
            if (d != n) {
                f(d);
                f(n / d);
                return;
            }
            ++x0;
        }
    };
    f(n);
    std::sort(p.begin(), p.end());
    std::vector<std::pair<i64, int>> ret;
    for (int l = 0, r = 0; l < p.size(); l = r) {
        while (r < p.size() && p[l] == p[r]) {
            r++;
        }
        ret.emplace_back(p[l], r - l);
    }
    return ret;
}

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

i64 inverse(i64 a, i64 m) {
    i64 x, y;
    exgcd(a, m, x, y);
    return x;
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int n, m;
    std::cin >> n >> m;
    
    std::vector<i64> a(n), b(m);
    for (int i = 0; i < n; i++) {
        std::cin >> a[i];
    }
    for (int i = 0; i < m; i++) {
        std::cin >> b[i];
    }
    
    int k;
    std::cin >> k;
    
    while (k--) {
        i64 M;
        std::cin >> M;
        
        auto fact = factorize(M);
        
        bool ok = true;
        i64 ans = 0;
        for (auto [p, e] : fact) {
            i64 pe = 1;
            for (int i = 0; i < e; i++) {
                pe *= p;
            }
            i64 v = 1;
            int k = 0;
            for (int i = 0; i < n; i++) {
                i64 x = a[i];
                while (x % p == 0) {
                    x /= p;
                    k++;
                }
                v = mul(v, x, pe);
            }
            for (int i = 0; i < m; i++) {
                i64 x = b[i];
                while (x % p == 0) {
                    x /= p;
                    k--;
                }
                v = mul(v, inverse(x, pe), pe);
            }
            if (k < 0) {
                ok = false;
                break;
            }
            for (int i = 0; i < std::min(k, e); i++) {
                v = mul(v, p, pe);
            }
            ans = (ans + mul(v, inverse(M / pe, pe), pe) * (M / pe)) % M;
        }
        if (ok) {
            std::cout << ans << "\n";
        } else {
            std::cout << "DIVISION BY ZERO\n";
        }
    }
    
    return 0;
}