#include<bits/stdc++.h>
using i64 = long long;
#define int i64
using pii = std::array<int, 2>;
void solve() {
	int n, m, q;
	std::cin >> n >> m >> q;
	std::vector<std::vector<pii> > e(n);
	for (int i = 1; i <= m; i ++) {
		int u, d;
		std::cin >> u >> d;
		if (d == 0) continue;
		int v = ((u + d) % n + n) % n;
		u = (u % n + n) % n;
		e[u].push_back({v, d});
	}
	// 0... n - 1
	std::vector<int> f(n);
	// 0 : not search
	// 1 : not to circle
	// 2 : to circle
	int op = 0;
	std::vector<int> dn(n), sum(n);
	auto dfs = [&](auto self, int u) -> int {
		dn[u] = op;
		f[u] = 1;
		int fuck = 0;
		for (auto it : e[u]) {
			int v = it[0], w = it[1];

			if (dn[v] == 0) {
				sum[v] = sum[u] + w;
				fuck |= self(self, v);
			} else if (dn[v] == op && sum[u] - sum[v] + w != 0) {
				fuck = 1;
			}

			if (f[v] == 2) {
				fuck = 1;
			}
		}
		if (fuck) {
			f[u] = 2;
		}
		return fuck;
	};
	for (int i = 0; i < n; i ++) {
		if (! f[i]) {
			op = i + 1;
			sum[i] = 0;
			dfs(dfs, i);
		}
	}
	while (q --) {
		int x;
		std::cin >> x;
		x = (x % n + n) % n;
		std::cout << (f[x] == 2 ? "Yes\n" : "No\n");
 	}
}
signed main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int t = 1;
	// std::cin >> t;
	while (t --) {
		solve();
	}
	return 0;
}

/*


3 2 3
0 1000000000
1 -1000000000
-1000000000
0
-1000000000

*/