#include<bits/stdc++.h>
#define endl '\n'
using namespace std;
const int N=5e5+10;
int n,m,q,sccno[N],cnt,id,dfn[N],low[N],s[N],top,f[N];
map<int,int> mp[N],t[N];
bool vis[N],ok[N];
void dfs(int x)
{
	dfn[x]=low[x]=++id;
	s[++top]=x;
	for(auto [y,z]:t[x])
	{
		if(!dfn[y]) dfs(y),low[x]=min(low[x],low[y]);
		else if(!sccno[y]) low[x]=min(low[x],dfn[y]);
	}
	if(low[x]==dfn[x])
	{
		++cnt;
		while(1)
		{
			int j=s[top];
			--top;
			sccno[j]=cnt;
			if(x==j) break;
		}
	}
}
void tarjan()
{
	for(int i=0;i<n;++i)
	  if(!dfn[i])
	    dfs(i);
}
void cal(int x)
{
	vis[x]=1;
	for(auto [y,z]:t[x])
	{
		if(sccno[y]!=sccno[x]) continue;
		if(mp[x][y]>1)
		{
			ok[sccno[x]]=1;
			return;
		}
		if(vis[y]&&f[y]!=f[x]+z) 
		{
			ok[sccno[x]]=1;
			return;
		}
		if(!vis[y]) f[y]=f[x]+z,cal(y);
	}
}
void work()
{
    cin>>n>>m>>q;
    for(int i=1;i<=m;++i)
    {
    	int x,y,b;
    	cin>>x>>b;
    	if(b==0)  continue;
    	x=(x%n+n)%n;
    	y=((x+b)%n+n)%n;
    	if(mp[x][y]&&b==t[x][y]) continue;
    	mp[x][y]++;
    	t[x][y]=b;
	}
	tarjan();
	for(int i=0;i<n;++i)
	  if(!vis[i]&&!ok[sccno[i]])
	    cal(i);
	for(int x=0;x<n;++x)
	{
		if(ok[sccno[x]]) continue;
		for(auto [y,z]:t[x])
		{
			if(ok[sccno[y]])
			{
				ok[sccno[x]]=1;
				break;
			}
		}
	}
	for(;q;--q)
	{
		int x;
		cin>>x;
		x=(x%n+n)%n;
		if(ok[sccno[x]]) cout<<"Yes"<<endl;
		else cout<<"No"<<endl;
	} 
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int T=1;
    //cin>>T;
    for(;T;--T)
      work();
    return 0;
}