#include <bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int, int> pii;
vector<pii> tu[1001000];
vector<int> tu1[1001000];
const int N = 1e6 + 10;
int low[N], dfn[N], vis[N], be[N], ok[N], sum[N];
int total, cnt, inde;
stack<int> st;
int flag;
void tarjan(int x) {
    dfn[x] = low[x] = ++total;
    vis[x] = 1;
    st.push(x);
    for (auto e : tu[x]) {
        if (!dfn[e.first]) {
            tarjan(e.first);
            low[x] = min(low[e.first], low[x]);
        } else if (vis[e.first] == 1) {
            low[x] = min(low[x], dfn[e.first]);
        }
    }
    if (dfn[x] == low[x]) {
        int v;
        inde = inde + 1;
        do {
            v = st.top();
            st.pop();
            be[v] = inde;
            vis[v] = 0;

        } while (v != x);
    }
}
void dfs(int u) {
    vis[u] = 1;
    for (auto [v, w] : tu[u]) {
        if (be[v] != be[u])
            continue;
        if (vis[v]) {
            if (sum[v] != sum[u] + w)
                ok[v] = 1;
        } else {
            sum[v] = sum[u] + w;
            dfs(v);
        }
    }
}
void dfs1(int u) {
    vis[u] = 1;
    for (int x : tu1[u])
        if (!vis[x])
            dfs1(x);
    ok[u] = 1;
}
void solve() {
    int n, m, q;
    cin >> n >> m >> q;
    for (int i = 1; i <= m; i++) {
        int x, y;
        cin >> x >> y;
        int temp = (x % n + n) % n;
        int temp2 = ((x + y) % n + n) % n;
        int val = y;
        tu[temp].push_back({temp2, val});
        tu1[temp2].push_back(temp);
    }
    for (int i = 1; i <= n; i++) {
        if (!dfn[i])
            tarjan(i);
    }
    memset(vis, 0, sizeof(vis));
    for (int i = 1; i <= n; i++) {
        if (!vis[i]) {
            dfs(i);
        }
    }
    memset(vis, 0, sizeof(vis));
    for (int i = 1; i <= n; i++) {
        if (!vis[i] && ok[i]) {
            dfs1(i);
        }
    }
    while (q--) {
        int temp;
        cin >> temp;
        temp = ((temp % n) + n) % n;
        cout << (ok[temp] == 1 ? "Yes\n" : "No\n");
    }
}
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
    // while (1)
    //     ;
}