#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 z;
void dfs(int u) {
    set<int> s;
    for (auto [v, w] : G[u]) {
        if (s.count(v)) {
            z = 1;
        } else
            s.insert(v);
        if (~vis[v]) {
            if (vis[u] - vis[v] + w != 0)
                z = 1;
        } else {
            vis[v] = vis[u] + w;
            dfs(v);
        }
    }
}
void solve() {
    memset(vis, -1, sizeof vis);
    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++) {
        int sum = 0, flag = 1;
        z = 0;
        for (auto u : vec[i]) {
            if (vis[u] == -1)
                dfs(u);
        }
        dp[i] = z;
    }
    for (int i = 1; i <= cscc; 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;
}