#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

const int N = 5e5 + 10, M = 5e5 + 10;

int n, m;
int h[N], e[M], ne[M], idx;
int low[N], dfn[N], timestamp;
int stk[N], top;
bool in_stk[N];
int scc_cnt, scc_size[N], id[N];
std::vector<int> vec[N];

void add(int a, int b) {
    e[idx] = b, ne[idx] = h[a], h[a] = idx ++ ;
}

void tarjan(int u) {
    low[u] = dfn[u] = ++ timestamp;
    stk[++ top] = u, in_stk[u] = true;
    for(int i = h[u]; i != -1; i = ne[i]) {
        int j = e[i];
        if(!dfn[j]) {
            tarjan(j);
            low[u] = min(low[u], low[j]);
        } else if(in_stk[j]) {
            low[u] = min(low[u], dfn[j]);
        }
    }
    if(low[u] == dfn[u]) {
        ++ scc_cnt;
        int y;
        do {
            y = stk[top -- ];
            id[y] = scc_cnt;
            in_stk[y] = false;
            scc_size[scc_cnt] ++ ;
            vec[scc_cnt].push_back(y);
        } while(u != y);
    }
}

void solve() {
    int n, m, q;
    cin >> n >> m >> q;
    memset(h, -1, sizeof(h));

    vector<vector<pii> > edge(n + 1);
    for(int i = 1; i <= m; i ++ ) {
        int a, b;
        cin >> a >> b;
        int u = (a % n + n) % n, v = ((a + b) % n + n) % n;
        u ++ , v ++ ;
        // cerr << u << ' ' << v << '\n';
        add(u, v);
        edge[u].push_back({v, b});
    }

    for(int i = 1; i <= n; i ++ ) {
        if(!dfn[i]) {
            tarjan(i);
        }
    }

    vector<int> ok(n + 1);
    vector<ll> st(n + 1), dist(n + 1);
    for(int i = 1; i <= scc_cnt; i ++ ) {
        auto dfs = [&](auto dfs, int u) -> void {
            if(ok[i]) return ;
            for(auto [v, w] : edge[u]) {
                if(id[v] == i) {
                    if(st[v]) {
                        if(dist[u] + w != dist[v]) {
                            ok[i] = 1;
                            return ;
                        } 
                        continue;
                    }
                    dist[v] = dist[u] + w;
                    st[v] = 1;
                    dfs(dfs, v);
                }
            }
        } ;
        if(vec[i].size()) {
            // cout << i << ": ";
            // for(int x : vec[i]) {
            //     cout << x << ' ';
            // }
            // cout << '\n';
            st[vec[i][0]] = 1;
            dist[vec[i][0]] = 0;
            dfs(dfs, vec[i][0]);
        }
    }

    vector<int> din(n + 1);
    vector<vector<int> > edge_scc(scc_cnt + 1);
    for(int i = 1; i <= n; i ++ ) {
        for(int j = h[i]; j != -1; j = ne[j]) {
            int k = e[j];
            int a = id[i], b = id[k];
            if(a != b) {
                edge_scc[b].push_back(a);
                din[a] ++ ;
            }
        }
    }

    queue<pii> q1;
    for(int i = 1; i <= scc_cnt; i ++ ) {
        if(!din[i]) {
            q1.push({i, ok[i]});
        }
    }
    while(q1.size()) {
        auto [u, staut] = q1.front();
        q1.pop();
        for(auto v : edge_scc[u]) {
            ok[v] |= staut;
            if(-- din[v] == 0) q1.push({v, ok[v]});
        }
    }

    // for(int i = 1; i <= scc_cnt; i ++ ) {
    //     cout << i << ' ' << ok[i] << '\n';
    // }
    while(q -- ) {
        int u;
        cin >> u;
        u = u % n + 1;
        if(ok[id[u]]) {
            cout << "Yes\n";
        } else {
            cout << "No\n";
        }
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    
    int t = 1;
    // cin >> t;
    while(t -- ) {
        solve();
    }
    
    return 0;
}