#include <cstdio>
#include <cstring>
#include <cstring>
#include <vector>

const int N = 500005;
std::vector<int> tr[N], cmp_g[N];
std::vector<std::pair<int, int> > g[N];
int n, m, q, cmp[N], ord[N];
long long dep[N];
bool gone[N], cyc[N], u[N];

int z(int x) {
	x %= n;
	x += n;
	return x % n;
}

void dfs(int v) {
	static int dt = 0;
	u[v] = 1;
	for (int i = 0; i < (int)g[v].size(); ++i) if (!u[g[v][i].first]) dfs(g[v][i].first);
	ord[dt++] = v;
}

int cur;
void dfs1(int v) {
	cmp[v] = cur;
	for (int i = 0; i < (int)tr[v].size(); ++i) if (!cmp[tr[v][i]]) dfs1(tr[v][i]);
}

bool run(int v) {
	gone[cmp[v]] = 1;
	u[v] = 1;
	for (int i = 0; i < (int)g[v].size(); ++i) {
		int to = g[v][i].first;
		if (cmp[to] == cmp[v]) {
			if (!u[to]) {
				dep[to] = dep[v] + g[v][i].second;
				if (run(to)) return true;
			} else {
				if (dep[v] - dep[to] + g[v][i].second) return true;
			}
		}
	}
	return false;
}

bool cmp_dfs(int v) {
	if (u[v]) return 1;
	u[v] = 1;
	for (int i = 0; i < (int)cmp_g[v].size(); ++i) cmp_dfs(cmp_g[v][i]);
    return 1;
}

int main() {
	scanf("%d%d%d", &n, &m, &q);
	for (int i = 0; i < m; ++i) {
		int a, b;
		scanf("%d%d", &a, &b);
		a = z(a);
		int dir = z(b + a);
		g[a].push_back(std::make_pair(dir, b));
		tr[dir].push_back(a);
	}
	for (int i = 0; i < n; ++i) if (!u[i]) dfs(i);
	for (int i = n - 1; i >= 0; --i) if (!cmp[ord[i]]) {
		++cur;
		dfs1(ord[i]);
	}
	memset(u, 0, sizeof u);
	for (int i = 0; i < n; ++i) if (!gone[cmp[i]] && run(i)) cyc[cmp[i]] = 1;
	for (int i = 0; i < n; ++i) for (int j = 0; j < (int)g[i].size(); ++i) {
		int to = g[i][j].first;
		if (cmp[i] != cmp[to]) cmp_g[cmp[to]].push_back(cmp[i]);
	}
	memset(u, 0, sizeof u);
	for (int i = 1; i <= cur; ++i) if (cyc[i]) cmp_dfs(i);
	while (q--) {
		int x;
		scanf("%d", &x);
		x = z(x);
		printf("%s\n", u[cmp[x]] ? "Yes" : "No");
	}
	return 0;
}