#include <cstdio>
#include <vector>
using namespace std;
using ll = long long;

int N,M,Q;
int Low[500001],Dfn[500001];
int Time;
struct edge
{
    int Next,To,From,W;
}Before[500001];
int Headbef[500001];
int Fa[500001];
int Stack[500001],Top;
int Lonbef;
ll Vis[500001];
bool In[500001];
bool OK[500001];
void Makebef(int From,int To,int W)
{
	Lonbef++;
	Before[Lonbef].Next=Headbef[From];
	Before[Lonbef].To=To;
    Before[Lonbef].W=W;
    Before[Lonbef].From=From;
	Headbef[From]=Lonbef;
}
void Tarjan(int Pos)
{
	Low[Pos]=Dfn[Pos]=++Time;
	Stack[++Top]=Pos;
	Vis[Pos]=1;
	for(int i=Headbef[Pos];i;i=Before[i].Next)
	{
		int To=Before[i].To;
		if(!Dfn[To])
		{
			Tarjan(To);
			Low[Pos]=min(Low[To],Low[Pos]);
		}
		else if(Vis[To])
		Low[Pos]=min(Low[To],Low[Pos]);
	}
	if(Dfn[Pos]==Low[Pos])
	{
		for(int i=Stack[Top--];;i=Stack[Top--])
		{
			Fa[i]=Pos;
			Vis[i]=0;
			if(i==Pos)break;
		}
	}
}
bool DFS(int Pos)
{
    In[Pos]=true;
    bool Ch=0;
    for(int i=Headbef[Pos];i;i=Before[i].Next)
	{
		int To=Before[i].To;
        if(Fa[To]!=Fa[Pos])
        continue;
        if(!In[To])
        {
            Vis[To]=Vis[Pos]+Before[i].W;
            Ch|=DFS(To);
        }
        else
        {
            if(Vis[To]!=Vis[Pos]+Before[i].W)
            Ch=true;
        }
    }
    return Ch;
}
void Cover(int Pos)
{
    In[Pos]=true;
    for(int i=Headbef[Pos];i;i=Before[i].Next)
	{
		int To=Before[i].To;
        if(!In[To])
        Cover(To);
        OK[Fa[Pos]]|=OK[Fa[To]];
    }
}
int main() {
    scanf("%d%d%d",&N,&M,&Q);
    for(int i=1;i<=M;++i)
    {
        int A,B;
        scanf("%d%d",&A,&B);
        A=(A%N+N)%N;
        if(!A)A=N;
        if(!B)continue;
        int To=(A+B%N+N-1)%N+1;
        Makebef(A,To,B);
    }
    for(int i=1;i<=N;++i)
    if(!Dfn[i])Tarjan(i);
    for(int i=1;i<=Lonbef;++i)
    if(Before[i].W%N==0)
    OK[Fa[Before[i].From]]=true;
    for(int i=1;i<=N;++i)
    {
        if(!In[i]&&Fa[i]!=i)
        {
            OK[Fa[i]]=DFS(i);
        }
    }
    for(int i=1;i<=N;++i)
    {
        if(!In[i])
        {
            Cover(i);
        }
    }
    for(int i=1;i<=Q;++i)
    {
        int X;
        scanf("%d",&X);
        X=(X%N+N)%N;
        if(!X)X=N;
        puts(OK[Fa[X]]?"Yes":"No");
    }
    return 0;
}