#include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
using namespace std;
const int maxn=5e5+5;
vector<pii>e[maxn];
int dfn[maxn],low[maxn],cnt;
int inst[maxn],scc[maxn],sc;
int fl[maxn],ans[maxn],ok[maxn];
vector<int>ins[maxn],stk;
void dfs(int x){
	dfn[x]=low[x]=++cnt;
	inst[x]=1;
	stk.push_back(x);
	for(auto t:e[x]){
		int u=t.first;
		if(!dfn[u]){
			dfs(u);
			low[x]=min(low[x],low[u]);
		}
		else if(inst[u])low[x]=min(low[x],dfn[u]);
	}
	if(low[x]==dfn[x]){
		sc++;
		while(1){
			int u=stk.back();
			inst[u]=0;
			scc[u]=sc;
			ins[sc].push_back(u);
			stk.pop_back();
			if(u==x)break;
		}
	}
}
ll dis[maxn];
int vis[maxn],T;
void dfs2(int x){
    if(ok[T]) return ;
	vis[x]=1;
	for(auto t:e[x]){
		int u=t.first,w=t.second;
		if(scc[u]!=scc[x])continue;
		if(vis[u]){
			if(dis[u]!=dis[x]+w)fl[T]=1,ok[T]=1;
			continue;
		}
		dis[u]=dis[x]+w;
		dfs2(u);
	}
}
void solve(){
	int n,m,q;
	cin>>n>>m>>q;
	for(int i=1;i<=m;i++){
		// int u,v,w;
		// cin>>u>>w;
		// u=(u%n+n)%n+1;
		// v=((u+w)%n+n)%n+1;
        int a, b;
        cin >> a >> b;
        int w = b;
        int u = (a % n + n) % n, v = ((a + b) % n + n) % n;       
        u ++ ;
        v ++ ; 
		e[u].push_back({v,w});
		// cout<<u<<" "<<v<<" "<<w<<"\n";
	}
	for(int i=1;i<=n;i++){
		if(!dfn[i]){
			dfs(i);
		}
	}
	for(int i=1;i<=sc;i++){
		T=i;
		dfs2(ins[i][0]);
		if(fl[i]){
			for(auto u:ins[i]){
				ans[u]=1;
			}
		}
	}

    vector<int> din(n + 1);
    vector<vector<int> > edge_scc(sc + 1);
    for(int i = 1; i <= n; i ++ ) {
        for(auto [v, w] : e[i]) {
            int a = scc[i], b = scc[v];
            if(a != b) {
                edge_scc[b].push_back(a);
                din[a] ++ ;
            }
        }
    }
 
    queue<pii> q1;
    for(int i = 1; i <= sc; 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<=q;i++){ 
		int x;
		cin>>x;
		x=(x%n+n)%n+1;
		if(ok[x])cout<<"Yes\n";
		else cout<<"No\n";
	}
}
int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int t=1;
	// cin>>t;
	while(t--)solve();
	return 0;
}