#define LOCAL
#include <bits/stdc++.h>
#define fir first
#define sec second
#define pbk push_back

#ifdef LOCAL
#define FINISH cerr << "FINISH" << endl;
#else
#define FINISH ;
#endif

#ifdef LOCAL
#define debug(x) cerr << setw(4) << #x << " == " << x << endl
#else
#define debug(x)
#endif

#ifdef LOCAL
#define debugv(x)                   \
    cerr << setw(4) << #x << ":: "; \
    for (auto i : x)                \
        cerr << i << " ";           \
    cerr << endl
#else
#define debugv(x)
#endif

using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
ostream& operator<<(ostream& out, PII& x)
{
    out << x.fir << " " << x.sec << endl;
    return out;
}

const ll MOD = 998244353;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const int N = 200020;

ll negmod(ll x,ll mod){
	return ((x%mod)+mod)%mod;
}

void solve()
{
    ll n,m,q;
	cin>>n>>m>>q;
	vector<vector<ll>> G(n+1,vector<ll>());
	for(int i=0;i<m;i++){
		ll a,b;
		cin>>a>>b;
		if(b!=0)G[negmod(a,n)].push_back(b);
	}
	vector<bool> ans(n,0);
	vector<int> vis(n,0);
	vector<ll> h(n);
	function<bool(ll)> dfs=[&](ll d){
		ll x=negmod(d,n);
		if(vis[x]){
			if(vis[x]==1)return bool(ans[x]);
			else{
				if(h[x]!=d)return true;
				else return false;
			}
		}
		vis[x]=2;
		h[x]=d;
		bool res=ans[x];
		for(ll y:G[x]){
			res|=dfs(d+y);
		}
		ans[x]=res;
		vis[x]=1;
		return res;
	};
	for(int i=0;i<n;i++){
		dfs(i);
	}
	vis.assign(n,0);
	for(int i=0;i<n;i++){
		set<ll> s;
		function<void(ll)> dfs0=[&](ll x){
			s.insert(x);
			if(vis[x]){
				return;
			}
			vis[x]=1;
			for(ll y:G[x]){
				dfs0(negmod(x+y,n));
			}
			return;
		};
		dfs0(i);
		bool flag=false;
		for(ll x:s)flag|=ans[x];
		if(flag){
			for(ll x:s){
				ans[x]=true;
			}
		}
	}
	vis.assign(n,0);
	while(q--){
		ll x;
		cin>>x;
		x=negmod(x,n);
		if(ans[x])cout<<"Yes\n";
		else cout<<"No\n";
	}

	return;
}
int main()
{
    // ios::sync_with_stdio(false);
    // cin.tie(nullptr);
    // cout.tie(nullptr);
    int T = 1;
    //cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}