#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <set>
using namespace std;
 
int cover(int l1, int r1, int l2, int r2){
    return max(min(r1, r2) - max(l1, l2) + 1, 0);
}
 
int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n, m, q, sa = 0, sb = 0, x;
    cin >> n >> m >> q;
    vector <int> a(n);
    vector <int> b(m);
    set <int> s;
    for(int i = 0; i < n; i++){
        cin >> a[i];
        sa += a[i];
    }
    for(int i = 0; i < m; i++){
        cin >> b[i];
        sb +=  b[i];
    }
    for(int i = 0; i < n; i++){
        for(int j = 0; j < m; j++){
            s.insert(sa * sb - a[i] * sb - b[j] * sa + a[i] * b[j]);
        }
    }
    while(q--){
        cin >> x;
        if(s.count(x))cout << "Yes\n";
        else cout << "No\n";
    }
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgojaW5jbHVkZSA8bWFwPgojaW5jbHVkZSA8YWxnb3JpdGhtPgojaW5jbHVkZSA8c2V0Pgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IGNvdmVyKGludCBsMSwgaW50IHIxLCBpbnQgbDIsIGludCByMil7CiAgICByZXR1cm4gbWF4KG1pbihyMSwgcjIpIC0gbWF4KGwxLCBsMikgKyAxLCAwKTsKfQoKaW50IG1haW4oKSB7CiAgICBjaW4udGllKDApLT5zeW5jX3dpdGhfc3RkaW8oMCk7CiAgICBpbnQgbiwgbSwgcSwgc2EgPSAwLCBzYiA9IDAsIHg7CiAgICBjaW4gPj4gbiA+PiBtID4+IHE7CiAgICB2ZWN0b3IgPGludD4gYShuKTsKICAgIHZlY3RvciA8aW50PiBiKG0pOwogICAgc2V0IDxpbnQ+IHM7CiAgICBmb3IoaW50IGkgPSAwOyBpIDwgbjsgaSsrKXsKICAgICAgICBjaW4gPj4gYVtpXTsKICAgICAgICBzYSArPSBhW2ldOwogICAgfQogICAgZm9yKGludCBpID0gMDsgaSA8IG07IGkrKyl7CiAgICAgICAgY2luID4+IGJbaV07CiAgICAgICAgc2IgKz0gIGJbaV07CiAgICB9CiAgICBmb3IoaW50IGkgPSAwOyBpIDwgbjsgaSsrKXsKICAgICAgICBmb3IoaW50IGogPSAwOyBqIDwgbTsgaisrKXsKICAgICAgICAgICAgcy5pbnNlcnQoc2EgKiBzYiAtIGFbaV0gKiBzYiAtIGJbal0gKiBzYSArIGFbaV0gKiBiW2pdKTsKICAgICAgICB9CiAgICB9CiAgICB3aGlsZShxLS0pewogICAgICAgIGNpbiA+PiB4OwogICAgICAgIGlmKHMuY291bnQoeCkpY291dCA8PCAiWWVzXG4iOwogICAgICAgIGVsc2UgY291dCA8PCAiTm9cbiI7CiAgICB9Cn0=

MyAzIDYKLTIgMyAtMwotMiAyIC0xCi0xCjEKLTIKMgotMwozCg==

3 3 6
-2 3 -3
-2 2 -1
-1
1
-2
2
-3
3