#include <bits/stdc++.h>
#define int long long 
#define pii pair<int,int>
#define fi first
#define se second
#define pb push_back
using namespace std;
const int INF=1e6+5;
int n,m,Q,low[INF],dfn[INF],vis3[INF],vis4[INF],vis[INF];
int ff[INF],gg[INF],tot,s[INF],r,f[INF];
vector < pii > e2[INF],e[INF];
void DFS(int x) {
    if (vis3[x]) return ;
    vis3[x]=1;
    for (pii it:e[x]) {
        int v=it.fi,d=it.se;
        if (!vis4[v]) continue;
        ff[v]=ff[x]+d;DFS(v);
    }
}
void DFS2(int x) {
    if (vis3[x]) return ;
    vis3[x]=1;
    for (pii it:e2[x]) {
        int v=it.fi,d=it.se;
        if (!vis4[v]) continue;
        gg[v]=gg[x]+d;DFS2(v);
    }
}
void tarjan(int x) {
    low[x]=dfn[x]=++tot;
    s[++r]=x;f[x]=1;
    for (pii it:e[x]) {
        int v=it.fi;
        if (!dfn[v]) {
            tarjan(v);
            low[x]=min(low[x],dfn[v]); 
        } else if (f[v])
            low[x]=min(low[x],low[v]);
    }
    if (low[x]==dfn[x]) {
        vector <int> cnt;
        int xx=s[r];r--;
        cnt.pb(xx);f[xx]=0;
        while (xx!=x) {
            xx=s[r];r--;
            cnt.pb(xx);f[xx]=0;
        }
        
        for (int i:cnt) vis4[i]=1;
        DFS(x);for (int i:cnt) vis3[i]=0;
        DFS2(x);
        int F=0;
        for (int xx:cnt) {
            if (ff[xx]+gg[xx]) F=1;
            for (pii it:e[xx]) {
                if (!vis4[it.fi]) continue;
                // cerr<<xx<<" "<<it.fi<<" "<<vis4[xx]<<" "<<<<" qwerij\n";
                if (ff[xx]+gg[it.fi]+it.se) F=1;
            }
        }
        for (int i:cnt) vis4[i]=0;
        if (!F) return ;
        for (int i:cnt) vis[i]=1;
    }
}
void solve() {
    cin>>n>>m>>Q;
    for (int i=1;i<=m;i++) {
        int a=0,b=0;cin>>a>>b;
        int aa=a%n,bb=(b+a)%n;
        aa+=n;aa%=n;
        bb+=n;bb%=n;
        if (aa==bb) {
            if (b) vis[aa]=1;
        }
        else {
            e[aa].pb({bb,b});
            e2[bb].pb({aa,b});
        }
    }
    for (int i=0;i<n;i++)
        if (!dfn[i]) tarjan(i);
    queue <int> q;
    for (int i=0;i<n;i++)
        if (vis[i]) q.push(i);
    while (q.size()) {
        int x=q.front();q.pop();
        for (pii it:e2[x]) {
            int v=it.fi;
            if (vis[v]) continue;
            vis[v]=1;q.push(v);
        }
    }
    for (int i=1;i<=Q;i++) {
        int x=0;cin>>x;
        x%=n;x+=n;x%=n;
        if (vis[x]) cout<<"Yes\n";
        else cout<<"No\n";
    }
}
signed main()
{
    // freopen("test.out","w",stdout);
    ios::sync_with_stdio(false);
    int t=1;
    while (t--) solve();
    return 0;
}