#include <iostream>
#include <vector>
#include <cmath>
#include <cstring>

using namespace std;
using P = pair<int, int>;
using ll = long long;

const int N = 5e5 + 5;

int n, m, q;

vector<P> ed[N];
vector<P> red[N];
vector<int> vs;
bool used[N];
int cmp[N];
int cmpnum;
vector<int> scc[N];
bool ans[N];

int mod(int x) {
	return (x % n + n) % n;
}

void add_edge(int a, int b, int w) {
	ed[a].emplace_back(b, w);
	red[b].emplace_back(a, w);
}

void dfs(int v) {
	used[v] = true;

	for (auto [to, _] : ed[v]) 
		if (!used[to])
			dfs(to);
	vs.push_back(v);
}

void rdfs(int v, int k) {
	used[v] = true;
	cmp[v] = k;
	scc[k].push_back(v);

	for (auto [to, _] : ed[v]) 
		if (!used[to])
			rdfs(to, k);
}

ll po[N];

bool dfs2(int v, int k) {
	used[v] = true;

	for (auto [to, w] : ed[v]) {
		if (cmp[to] != k) continue;
		if (!used[to]) {
			po[to] = po[v] + w;
			if (!dfs2(to, k)) 
				return false;
		} else if (po[v] + w != po[to]) {
			return false;
		}
	}

	return true;
}

bool check(int k) {
	for (auto v : scc[k]) 
		used[v] = false;

	int s = scc[k][0];
	po[s] = 0;
	return dfs2(s, k);
}

void rdfs2(int v) {
	ans[v] = true;

	for (auto [to, _] : ed[v]) 
		if (!ans[to])
			rdfs2(to);
}

void solve() {
	cin >> n >> m >> q;

	for (int i = 0; i < m; i++) {
		int a, b;
		cin >> a >> b;
		add_edge(mod(a), mod(a + b), b);
	}

	for (int i = 0; i < n; i++) {
		if (!used[i])
			dfs(i);
	}

	memset(used, 0, sizeof(used));

	for (int i = n; i--; ) {
		if (!used[vs[i]])
			rdfs(vs[i], cmpnum++);
	}

	for (int i = 0; i < cmpnum; i++) {
		if (!check(i)) {
			rdfs2(scc[i][0]);
		}
	}

	while (q--) {
		int x;
		cin >> x;
		puts(ans[mod(x)] ? "Yes" : "No");
	}
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	// int t; cin >> t; while (t--)
		solve();
	return 0;
}