#include <bits/stdc++.h>

using namespace std;

#define int long long

void solve() {
    int n, m, q;
    std::cin >> n >> m >> q;
    std::vector<std::pair<int, int>> edges(m);
    vector<vector<pair<int,int>>> adj(n);
    for (auto &[a, b] : edges) {
        cin >> a >> b;
        a = (a % n + n) % n;
        int u = a, v = u + b;
        int w = 0;
        w = v / n;
        v -= v / n * n;

        while (v < 0) {
            v += n;
            w += 1;
        }

        while (v >= n) {
            v -= n;
            w -= 1;
        }
        adj[u].push_back({v, w});
    }

    std::vector<int> vis(n, -1E18);
    std::vector<int> ok(n, 0);

    for (int i = 0; i < n; i++) {
        if (vis[i] == -1E18) {
            auto dfs = [&](auto self, int x, int fx, int d) -> void {
                if (vis[x] == -1E18) {
                    vis[x] = d;
                }
                for (auto [y, w] : adj[x]) {
                    if (vis[y] == -1E18) {
                        self(self, y, x, d + w);
                    } else {
                        if (vis[y] != d + w) {
                            ok[y] = true;
                        }
                    }
                    ok[x] |= ok[y];
                }

            };
            dfs(dfs, i, -1, 0);
        }
    }

    // for (int i = 0; i < n; i++) {
    //     std::cerr << vis[i] << " \n"[i == n - 1];
    // }
    // for (int i = 0; i < n; i++) {
    //     std::cerr << ok[i] << " \n"[i == n - 1];
    // }
    for (int i = 1; i <= q; i++) {
        int x;
        std::cin >> x;
        x = (x % n + n) % n;

        std::cout << (ok[x] ? "Yes" : "No") << "\n";
    }



}

signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);
    int t = 1;
    // std::cin >> t;

    while (t --) {
        solve();
    }
}