#include <bits/stdc++.h>
using namespace std;
#define int long long
#define de(a) cout << #a << " = " << a << "\n"
#define deg(a) cout << #a << " = " << a << " "
const long double pi = acos(-1);
constexpr long double eps = 1e-12;
constexpr long long inf = 0x3f3f3f3f3f3f3f3f;
constexpr long long mod = 998244353;
constexpr int N = 1e6 + 10;
constexpr int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};

void solve() {
    int n, m, q;
    cin >> n >> m >> q;

    auto mod = [&](int x) -> int {
        return ((x % n) + n) % n;
    };

    vector<vector<int>> nxt(n), rev(n);
    for (int i = 0; i < m; i++) {
        int a, b;
        cin >> a >> b;
        nxt[mod(a)].emplace_back(b);
        rev[mod(a + b)].emplace_back(mod(a));
    }

    vector<int> cnt(n), vis(n), find(n);
    vector<pair<int, int>> p(n, {-inf, inf});
    for (int i = 0; i < n; i++) {
        if (vis[i]) {
            continue;
        }

        queue<tuple<int, int, int>> q;
        q.emplace(i, i, i);
        vis[i] = 1;

        while (!q.empty()) {
            auto [now, mx, mn] = q.front();
            q.pop();

            map<int, int> mmx, mmn;
            for (auto x : nxt[now]) {
                int p = mod(now + x);
                vis[p] = 1;
                if (mmx.count(p)) {
                    mmx[p] = max(mmx[p], mx + x);
                } else {
                    mmx[p] = mx + x;
                }
                if (mmn.count(p)) {
                    mmn[p] = min(mmn[p], mn + x);
                } else {
                    mmn[p] = mn + x;
                }
            }

            for (auto [u, v] : mmx) {
                pair<int, int> s = {v, mmn[u]};
                if (p[u] == s) {
                    continue;
                } else if (p[u] == make_pair(-inf, inf)) {
                    p[u] = s;
                    q.emplace(u, v, mmn[u]);
                } else {
                    find[u] = 1;
                }
            }
        }
    }

    vector<int> ans(n);
    for (int i = 0; i < n; i++) {
        if (find[i]) {
            queue<int> q;
            q.emplace(i);
            ans[i] = 1;

            while (!q.empty()) {
                int now = q.front();
                q.pop();

                for (auto x : rev[now]) {
                    if (!ans[x]) {
                        ans[x] = 1;
                        q.emplace(x);
                    }
                }
            }
        }
    }

    while (q--) {
        int x;
        cin >> x;
        cout << (ans[mod(x)] ? "Yes\n" : "No\n");
    }
}

signed main() {
    ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);

    int T = 1;
    // cin >> T, cin.get();
    while (T--) {
        solve();
    }

    return 0;
}