#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pair<int,int>>
#define vll vector<pair<ll,ll>>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define vvii vector<vector<pair<int,int>>>
#define vvll vector<vector<pair<ll,ll>>>
#define vst vector<string>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define mkunique(x) sort(all(x));(x).erase(unique(all(x)),(x).end())
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=500005,INF=15<<26;

// https://ei1333.github.io/luzhiled/snippets/structure/union-find.html

template< typename T >
struct WeightedUnionFind {
    vector< int > data;
    vector< T > ws;
    
    WeightedUnionFind() {}
    
    WeightedUnionFind(int sz) : data(sz, -1), ws(sz) {}
    
    int find(int k) {
        if(data[k] < 0) return k;
        auto par = find(data[k]);
        ws[k] += ws[data[k]];
        return data[k] = par;
    }
    
    T weight(int t) {
        find(t);
        return ws[t];
    }
    
    bool unite(int x, int y, T w) {
        w += weight(x);
        w -= weight(y);
        x = find(x), y = find(y);
        if(x == y){
            if(w) return false;
            return true;
        }
        if(data[x] > data[y]) {
            swap(x, y);
            w *= -1;
        }
        data[x] += data[y];
        data[y] = x;
        ws[y] = w;
        return true;
    }
    
    T diff(int x, int y) {
        return weight(y) - weight(x);
    }
};


vll G[MAX];
vi rG[MAX];
bool ok[MAX];

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    ll N,M,Q;cin>>N>>M>>Q;
    vi indeg(N);
    for(int i=0;i<M;i++){
        ll a,b;cin>>a>>b;
        ll sv=b;
        a%=N;
        if(a<0) a+=N;
        if(b==0) continue;
        b=(a+b)%N;
        if(b<0) b+=N;
        
        G[a].pb(mp(b,sv));
        rG[b].pb(a);
        indeg[b]++;
    }
    
    {
        queue<int> Q;
        for(int i=0;i<N;i++){
            if(indeg[i]==0) Q.push(i);
        }
        
        while(!Q.empty()){
            int u=Q.front();Q.pop();
            for(auto [to,co]:G[u]){
                if(indeg[to]){
                    indeg[to]--;
                    if(indeg[to]==0) Q.push(to);
                }
            }
        }
        
        WeightedUnionFind<ll> uf(N);
        
        for(int i=0;i<N;i++){
            if(indeg[i]){
                for(auto [to,co]:G[i]){
                    if(indeg[to]){
                        if(!uf.unite(i,to,co)){
                            ok[i]=true;
                            Q.push(i);
                            break;
                        }
                    }
                }
            }
        }
        
        while(!Q.empty()){
            int u=Q.front();Q.pop();
            for(int to:rG[u]){
                if(!ok[to]){
                    ok[to]=true;
                    Q.push(to);
                }
            }
        }
    }
    
    while(Q--){
        ll x;cin>>x;
        x%=N;
        if(x<0) x+=N;
        if(ok[x]) cout<<"Yes\n";
        else cout<<"No\n";
    }
}