//This program need not to be initialized(Write this for all programs)
//ignore the initial zero and initial by self
//samples must be tested before submitting
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N=5e5+5;
ll n,m,q;//number of floors,relocation instructions(edges),queries
struct node{
	int v;
	ll d;
};
vector<node>e[N];//edges
vector<int>e_opp[N];
void addedge(ll x,ll d){//x floor add d
	if(!d)return ;
	x=(x%n+n)%n;
	ll y=x+d;y=(y%n+n)%n;
	e[x].push_back((node){y,d});
	e_opp[y].push_back(x);	
	//if(x==y)tag[x]=1; 
	return ;
}
ll pts=0;//
ll low[N],dfn[N],top[N],tops;
vector<int>scc[N];//strong connected component
ll pe[N];//potential energy;   
int judge(int tp){//only consider pts in the scc
	//pe[scc[tp][0]]=0;//initialize
	//dfs(scc[tp][0],tp);
	int sz=scc[tp].size();
	for(int i=0;i<sz;i++){
		int u=scc[tp][i];
		for(int j=0;j<e[u].size();j++){
			int v=e[u][j].v;;
			if(top[v]!=tp)continue;
			ll d=e[u][j].d;//try to avoid 强制转换 
			
			if(pe[v]!=(pe[u]+d))return 1; 
		}
	}
	return 0;
}
stack<int>st;
int tag[N];//is it in a non-zero scc?
void tarjan(int u){
	st.push(u);
	low[u]=dfn[u]=++pts;top[u]=0;//initialize
	//no usage of dfn[0]: avoid usage of 0
	for(int i=0;i<e[u].size();i++){
		int v=e[u][i].v;
		if(!dfn[v]){
			pe[v]=pe[u]+e[u][i].d;
			tarjan(v);
			low[u]=min(low[u],low[v]);
			//there suppose to be if !top[v],but this doesn't change the result 
		}
		else if(!top[v]){//!top[v] means that v is in stack
			low[u]=min(low[u],dfn[v]);//why ?
		}
	} 
	if(low[u]==dfn[u]){
		tops=u;
		while(1){
			int x=st.top();st.pop();
			top[x]=tops;	
			scc[tops].push_back(x);
			if(x==u)break;
		}
		tag[u]=judge(tops);
	}
}
int vis[N];
void run_opp(int u){
	//if(tag[u])return ; //(initial points should not be deleted)
	//if(vis[u])return ;
	//vis[u]=1;
	for(int i=0;i<e_opp[u].size();i++){
		int v=e_opp[u][i];
		if(tag[v])return ;
		tag[v]=1;
		run_opp(v);
	}
}
int main(){
	scanf("%d%d%d",&n,&m,&q);
	int a,b;
	for(int i=1;i<=m;i++){
		scanf("%d%d",&a,&b); 
		addedge(a,b);
	}
	for(int i=0;i<n;i++){
		if(!dfn[i])tarjan(i);
	}
	for(int i=0;i<n;i++)tag[i]=tag[top[i]];
	for(int i=0;i<n;i++){
		if(tag[i])run_opp(i);
	}
	while(q--){
		int x;
		scanf("%d",&x);
		x=(x%n+n)%n;
		if(tag[x])puts("Yes");
		else puts("No");
	}
	return 0;
}
//How to debug: read and try to analize every step