#include <bits/stdc++.h>
using namespace std;
#define maxn 500005
#define int long long
#define ll long long
#define pii pair<int,int>

vector<pii>g[maxn],g2[maxn];
stack<int>st;
int dn,dfn[maxn],low[maxn];
int scc[maxn],cnt;
bool instk[maxn];
bool ok[maxn];
bool vis[maxn];

void tarjan(int k)
{
    dfn[k]=low[k]=++dn;
    st.push(k),instk[k]=1;
    for(auto [len,x]:g[k])
    {
        if(!dfn[x])
        {
            tarjan(x);
            low[k]=min(low[k],low[x]);
        }
        else if(dfn[x]&&instk[x]) low[k]=min(low[k],dfn[x]);
    }
    if(dfn[k]==low[k])
    {
        cnt++;
        while(1)
        {
            int temp=st.top();
            st.pop();
            instk[temp]=0;
            scc[temp]=cnt;
            if(temp==k)break;
        }
    }
}

ll dp[maxn],nows;

void dfs1(int u){
    vis[u]=1;
    for(auto [w,v]:g[u]){
        if(scc[v]!=nows)continue;
        if(vis[v]){
            if(dp[v]!=dp[u]+w){
                ok[nows]=1;
            }
        }
        else{
            dp[v]=dp[u]+w;
            dfs1(v);
        }
    }
}

void dfs2(int u){
    vis[u]=1;
    for(auto [w,v]:g2[u]){
        if(!vis[v])dfs2(v);
        if(ok[v])ok[u]=1;
    }
}

signed main(){
    int n,m,q;cin>>n>>m>>q;
    for(int i=1;i<=m;i++){
        int a,b;cin>>a>>b;
        a=(a%n+n)%n;
        int nxt=(a+b)%n;
        g[a].push_back({b,nxt});
    }
    for(int i=0;i<n;i++){
        if(!dfn[i]) tarjan(i);
    }

    for(int i=0;i<n;i++){
        for(auto [w,v]:g[i]){
            if(scc[i]==scc[v])continue;
            g2[scc[i]].push_back({w,scc[v]});
        }
    }

    
    for(int i=0;i<n;i++){
        if(vis[i])continue;
        nows=scc[i];
        dfs1(i);
    }

    memset(vis,0,sizeof(vis));

    for(int i=1;i<=cnt;i++){
        if(!vis[i])dfs2(i);
    }

    for(int i=1;i<=q;i++){
        int x;cin>>x;
        x=(x%n+n)%n;
        if(ok[scc[x]]){
            cout<<"Yes\n";
        }
        else cout<<"No\n";
    }
    
    
}