#include<bits/stdc++.h>
#define int long long
using namespace std;
int Read(){
	int x=0;
	char ch=getchar();bool f=0;
	while(ch<'0'||ch>'9') if(ch=='-')f=1,ch=getchar(); else if(ch==EOF)return 0; else ch=getchar();
	while(ch>='0'&&ch<='9') x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
	return f?-x:x;
}
int h[500003];
int nxt[500005];
int to[500005];
int cnt;
int ans[500005];
void link(int x,int y){
	nxt[++cnt]=h[x];
	h[x]=cnt;
	to[cnt]=y;
	return ;
}
bool vis[500005];
int pth[500005];
int n,m,q;
bool dfs(int x){
	vis[x]=1;
	for(int i=h[x];i;i=nxt[i]){
		int y=to[i];
		int k=((x+y)%n+n)%n;
		if(vis[k]){
			if(pth[x]-pth[k]+y){
				ans[k]=1;ans[x]=1;return 1;
			}else continue;
		}
		pth[k]=pth[x]+y;
		if(dfs(k)){
			ans[x]=1;return 1;
		}
	}ans[x]=2;
	return 0;
}
signed main(){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	n=Read(),m=Read(),q=Read();
	while(m--){
		int x=Read(),y=Read();
		x=(x%n+n)%n;
		link(x,y);
	}
	for(int i=0;i<n;i++){
		if(!ans[i]){
			dfs(i);
		} 
	}while(q--){
		int x=Read();x=(x%n+n)%n;
		if(ans[x]==1) printf("Yes\n");
		else printf("No\n");
	}
	return 0;
}