#include <bits/stdc++.h>
using namespace std;
using ll = long long;

struct node {
    int x;
    int id;
    int ans;
};

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

    int n, m, q;
    cin >> n >> m >> q;

    vector<vector<pair<int, int>>> E(n);
    vector<vector<int>> fan(n);
    while (m--) {
        int u, w;
        cin >> u >> w;
        int v = u + w;
        u = (u % n + n) % n;
        v = (v % n + n) % n;
        E[u].push_back({ w, v });
        fan[v].push_back(u);
    }

    vector<int> vis(n);
    vector<ll> val(n);
    vector<int> banugly(n);
    vector<int> ugly(n);
    vector<vector<pair<int, int>>> E_dag(n), E_back(n);
    for (int i = 0; i < n; i++) {
        if (vis[i]) continue;
        auto dfs = [&](auto&& self, int u) -> void {
            vis[u] = 1;
            for (auto [w, v] : E[u]) {
                if (vis[v] == 0) {   // tree edge
                    E_dag[u].push_back({ w, v });
                    val[v] = val[u] + w;
                    self(self, v);
                } else if (vis[v] == 1) {  // back edge
                    E_back[u].push_back({ w, v });
                    if (val[u] + w != val[v]) {
                        ugly[v] = 1;
                    }
                } else {  // cross edge or forward edge
                    E_dag[u].push_back({ w, v });
                    if (val[u] + w != val[v]) {
                        banugly[v] = 1;
                    }
                }
            }
            vis[u] = 2;
        };
        dfs(dfs, i);
    }

    E = E_dag;
    vis.assign(n, 0);
    for (int i = 0; i < n; i++) {
        if (vis[i]) continue;
        auto dfs = [&](auto&& self, int u) -> void {
            vis[u] = 1;
            for (auto [w, v] : E[u]) {
                if (banugly[v]) continue;
                if (banugly[u]) {
                    banugly[v] = 1;
                    self(self, v);
                }
            }
            vis[u] = 2;
        };
        dfs(dfs, i);
    }


    for (int u = 0; u < n; u++) {
        for (auto [w, v] : E_back[u]) {
            if (banugly[u]) {
                ugly[v] = 1;
            }
        }
    }

    queue<int> Q;
    for (int u = 0; u < n; u++) {
        if (ugly[u]) Q.push(u);
    }

    while (!Q.empty()) {
        int u = Q.front(); Q.pop();
        for (auto v : fan[u]) {
            if (ugly[v]) continue;
            ugly[v] = 1;
            Q.push(v);
        }
    }

    while (q--) {
        int u;
        cin >> u;
        u = (u % n + n) % n;
        cout << (ugly[u] ? "Yes" : "No") << endl;
    }
    

    return 0;
}