#include<iostream>
#include<cstdio>
using namespace std;
const int MX=500050;

int T, N, M, Q;
int fa[MX];
bool ring[MX];
int read()
{
    int r=0, f=1; char ch=getchar();
    while(ch<'0'||ch>'9') {if(ch=='-') f=-1; ch=getchar();}
    while(ch>='0'&&ch<='9') {r=r*10+ch-'0'; ch=getchar();}
    return r*f;
}
int find(int x){return x==fa[x]?x:fa[x]=find(fa[x]);}
void merge(int x, int y)
{
    x=find(x); y=find(y);
    if(x==y) ring[y]=1;
    fa[x]=y;
}
int main()
{
    // freopen("testdata.in","r",stdin);
    N=read(); M=read(); Q=read();
    for(int i=1;i<=N;i++) fa[i]=i;
    for(int i=1;i<=M;i++)
    {
        int a=read(), b=read();
        // cout << "a=" << a << ", b=" << b << '\n';
        a=(a%N+N)%N;
        if(b==0) continue;
        int to=((a+b)%N+N)%N;
        merge(a,to);
    }
    while(Q--)
    {
        int x=read();
        x=(x%N+N)%N;
        if(ring[find(x)]) cout << "Yes\n";
        else cout << "No\n";
    }
}