#include<bits/stdc++.h>
#define rep2(i, s, n) for(ll i = ll(s); i < ll(n); i++)
#define rrep2(i, n, t) for(ll i = ll(n)-1; i >= ll(t); i--)
#define rep(i, n) rep2(i, 0, n)
#define rrep(i, n) rrep2(i, n, 0)
#define eb emplace_back
#define SZ(a) ll(a.size())
#define all(a) a.begin(),a.end()
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vp = vector<P>;
using vvp = vector<vp>;
bool chmin(auto &a, auto b) { return a > b ? a = b, true : false; }
bool chmax(auto &a, auto b) { return a < b ? a = b, true : false; }
const ll inf = LLONG_MAX / 4;

#define ln "\n"

int main() {
	cin.tie(0)->sync_with_stdio(0);
    ll n,m,q; cin >> n >> m >> q;
    auto val=[&](ll a){
        a%=n;
        a+=n;
        a%=n;
        return a;
    };
    vvl be(n), de(n), we(n);
    rep(i,m){
        ll a,b; cin >> a >> b;
        ll c=val(a), d=val(a+b);
        be[c].eb(d);
        we[c].eb(b);
        be[d].eb(c);
        we[d].eb(-b);
        de[d].eb(c);
    }
    vl dist(n, -1);
    vector<bool> flag(n);
    rep(i,n){
        if(dist[i] != -1) continue;
        dist[i]=0;
        queue<ll> que;
        que.push(i);
        while(!que.empty()){
            ll now=que.front(); que.pop();
            rep(i,SZ(be[now])){
                ll next=be[now][i];
                if(dist[next] == -1){
                    dist[next]=dist[now]+we[now][i];
                    que.push(next);
                }
                else if(dist[next] != dist[now]+we[now][i]){
                    flag[now]=flag[next]=true;
                }
            }
        }
    }
    queue<ll> que;
    rep(i,n){
        if(flag[i]) que.push(i);
    }
    while(!que.empty()){
        ll now=que.front(); que.pop();
        for(auto next:de[now]){
            if(!flag[next]){
                flag[next]=true;
                que.push(next);
            }
        }
    }
    while(q--){
        ll x; cin >> x;
        x=val(x);
        cout << (flag[x] ? "Yes" : "No") << ln;
    }
}