#include<bits/stdc++.h>
using namespace std;
typedef  long long LL;
typedef pair<LL,int> PII;
const int N=1e6+10,M=2*N;
const int mod=998244353;
int h[N],e[M],ne[M],idx;
int st[N];
int n,m,q;
int dfn[N], low[N], timestamp;
int stk[N], top;
bool in_stk[N];
int id[N], scc_cnt, Size[N];
int dout[N];
LL f[N],ft[N],ans[N];
LL w[M];


void add(int a, int b,int c)
{
    w[idx]=c,e[idx] = b, ne[idx] = h[a], h[a] = idx ++ ;
}

void tarjan(int u)
{
    dfn[u] = low[u] = ++ timestamp;
    stk[ ++ top] = u, in_stk[u] = true;
    for (int i = h[u]; i != -1; i = ne[i])
    {
        int j = e[i];
        if (!dfn[j])
        {
            tarjan(j);
            low[u] = min(low[u], low[j]);
        }
        else if (in_stk[j]) low[u] = min(low[u], dfn[j]);
    }

    if (dfn[u] == low[u])
    {
        ++ scc_cnt;
        int y;
        do {
            y = stk[top -- ];
            in_stk[y] = false;
            id[y] = scc_cnt;
            Size[scc_cnt] ++ ;
        } while (y != u);
    }
}

int get_mod(int x){
    int t=-x%n;

    return (n-t)%n;
}

bool check(int u){
    int hh=0,tt=0;
    f[0]=u;
    ft[u]=true;

    while(hh<=tt){
        int v=f[hh++];

        for(int i=h[v];~i;i=ne[i]){
            int j=e[i];
            if(id[j]!=id[v]) continue;

            if(ft[j]){
                if(ans[j]==ans[v]+w[i]) continue;
                return true;
            }

            ft[j]=true;
            ans[j]=ans[v]+w[i];
            f[++tt]=j;
        }
    }

    return false;
}



void solve(){
    cin>>n>>m>>q;
    memset(h,-1,sizeof h);

    vector<int> root;

    while(m--){
        int a,b;
        cin>>a>>b;
        int g=b;
        if(b==0) continue;

        b=a+b;
        if(a<0) a=get_mod(a);
        else a%=n;
        if(b<0) b=get_mod(b);
        else b=b%n;
        //cout<<a<<" "<<b<<endl;
        if(a==b) root.push_back(a);
        else add(b,a,g);

    }


    for(int i=0;i<n;i++) if(!id[i]) tarjan(i);

    for(auto t:root) st[id[t]]=true;
    //cout<<id[1]<<endl;


    vector<int> a[scc_cnt+1];
    
    //for(int i=0;i<n;i++) cout<<id[i]<<" ";
    //cout<<endl;
    
    for(int i=0;i<n;i++) a[id[i]].push_back(i);
    for(int i=1;i<=scc_cnt;i++) if(check(a[i][0])) st[i]=true;

    for(int i=scc_cnt;i>0;i--){
        for(auto u:a[i]){
            for(int i=h[u];~i;i=ne[i]){
                int j=e[i];
                //cout<<id[u]<<" "<<id[j]<<endl;
                j=id[j];

                st[j]=st[id[u]];
            }
        }
    }

    while(q--){
        int x;
        cin>>x;
        if(x<0) x=get_mod(x);
        else x%=n;
        //cout<<x<<endl;
        if(st[id[x]]) cout<<"Yes"<<endl;
        else cout<<"No"<<endl;
    }

}
 
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int T=1;
    //cin>>T;

    while(T--) solve();
 
    return 0;
}