#include<bits/stdc++.h>
#define int long long
#define ll long long
#define pii pair<int, int>
using namespace std;
const int maxn = 5e5 + 10;
vector<pii> G[maxn];
vector<int> vec[maxn];
stack<int> stk;
int dfn[maxn], low[maxn], instk[maxn], scc[maxn], cscc, Cnt;
int dp[maxn], vis[maxn];
void tarjan(int u) {
    low[u] = dfn[u] = ++Cnt;
    instk[u] = 1;
    stk.push(u);
    for (auto [v, w] : G[u]) {
        if (!dfn[v]) {
            tarjan(v);
            low[u] = min(low[u], low[v]);
        } else if (instk[v])
            low[u] = min(low[u], dfn[v]);
    }
    if (low[u] == dfn[u]) {
        int top;
        cscc++;
        do {
            top = stk.top();
            stk.pop();
            instk[top] = 0;
            scc[top] = cscc;
            vec[cscc].push_back(top);
        } while (top != u);
    }
}
int in[maxn], dis[maxn], CNT[maxn];
void solve() {
    memset(vis, -1, sizeof vis);
    memset(dis, 0x3f, sizeof dis);
    int n, m, Q; cin >> n >> m >> Q;
    for (int i = 1; i <= m; i++) {
        int a, b; cin >> a >> b;
        if (b == 0) continue;
        a = (a % n + n) % n;
        int v = (a + b % n + n) % n;
        G[a].emplace_back(v, b);
    }
    for (int i = 0; i < n; i++)
        if (!dfn[i]) tarjan(i);
    for (int i = 1; i <= cscc; i++) {
        queue<int> q;
        q.push(vec[i][0]);
        dis[vec[i][0]] = 0;
        CNT[vec[i][0]] = 1;
        while (!q.empty()) {
            int u = q.front(); q.pop();
            in[u] = 0;
            if (CNT[u] > vec[i].size()) {
                dp[i] = 1;
                break;
            }
            for (auto [v, w] : G[u]) {
                if (scc[v] != scc[u]) continue;
                if (dis[v] > dis[u] + w) {
                    dis[v] = dis[u] + w;
                    if (!in[v]) {
                        in[v] = 1;
                        CNT[v]++;
                        q.push(v);
                    }
                }
            }
        }
        while (!q.empty()) q.pop();
        for (auto u : vec[i]) in[u] = CNT[u] = 0, dis[u] = -1e9;
        if (dp[i]) continue;
        q.push(vec[i][0]);
        dis[vec[i][0]] = 0;
        CNT[vec[i][0]] = 1;
        while (!q.empty()) {
            int u = q.front(); q.pop();
            in[u] = 0;
            if (CNT[u] > vec[i].size()) {
                dp[i] = 1;
                break;
            }
            for (auto [v, w] : G[u]) {
                if (scc[v] != scc[u]) continue;
                if (dis[v] < dis[u] + w) {
                    dis[v] = dis[u] + w;
                    if (!in[v]) {
                        in[v] = 1;
                        CNT[v]++;
                        q.push(v);
                    }
                }
            }
        }
    }
    for (int i = cscc; i; i--) {
        for (auto u : vec[i])
            for (auto [v, w] : G[u]) {
                if (scc[u] != scc[v]) {
                    dp[scc[u]] |= dp[scc[v]];
                }
            }
    }
    while (Q--) {
        int x; cin >> x;
        x = (x % n + n) % n;
        if (dp[scc[x]]) cout << "Yes\n";
        else cout << "No\n";
    }
}
signed main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t = 1;
    // cin >> t;
    while (t--) solve();
    return 0;
}