#include <stdio.h>
#include <string.h>

#include <queue>
#include <algorithm>

#define LOG(FMT...) fprintf(stderr, FMT)

#define fi first
#define se second
#define em emplace
#define eb emplace_back

using namespace std;

typedef long long LL;
constexpr int N = 500005;

int n, m, Q;
bool was[N], f[N];
LL ver[N];
vector<int> e[N];

int sid(LL x) {
	x %= n;
	if (x < 0) x += n;
	return (int)x;
}

bool dfs(LL s) {
	int x = sid(s);
	if (was[x]) {
		return f[x];
	}
	was[x] = true;
	f[x] = false;
	ver[x] = s;
	for (int d : e[x]) {
		LL t = s + d;
		int y = sid(t);
		if (ver[y] == t) {
			continue;
		}
		if (~ver[y]) {
			f[x] = true;
			break;
		}
		dfs(t);
		f[x] |= f[y];
	}
	ver[x] = -1;
	return f[x];
}

int main() {
	scanf("%d%d%d", &n, &m, &Q);
	for (int x = 0; x < n; ++x) {
		e[x].clear();
	}
	for (int i = 0, a, b; i < m; ++i) {
		scanf("%d%d", &a, &b);
		e[sid(a)].eb(b);
	}
	memset(was, 0, n);
	memset(ver, -1, n << 2);
	while (Q--) {
		int x;
		scanf("%d", &x);
		x = sid(x);
		puts(dfs(x) ? "Yes" : "No");
	}
	return 0;
}