#include <bits/stdc++.h>
using namespace std;
constexpr int N = 5e5 + 5;
int n, m, q;
struct Edge
{
	int next, to, dis;
} edge[N];
int head[N], num_edge;
inline void add_edge(int from, int to, int dis)
{
	edge[++num_edge].next = head[from];
	edge[num_edge].to = to;
	edge[num_edge].dis = dis;
	head[from] = num_edge;
}
int dfn[N], low[N], dfstime;
int st[N], top;
bool dp[N], answer[N];
long long dis[N];
int belong[N], color;
inline void tarjan(int u)
{
	st[++top] = u;
	dfn[u] = low[u] = ++dfstime;
	for (int i = head[u]; i; i = edge[i].next)
	{
		int v = edge[i].to;
		if (!dfn[v])
		{
			dis[v] = dis[u] + edge[i].dis;
			tarjan(v);
			low[u] = min(low[u], low[v]);
		}
		else if (!belong[v])
		{
			low[u] = min(low[u], dfn[v]);
			if (dis[v] != dis[u] + edge[i].dis)
				dp[v] = true;
		}
		dp[u] |= dp[v];
	}
	if (dfn[u] == low[u])
	{
		answer[belong[u] = ++color] |= dp[u];
		while (st[top] != u)
		{
			answer[belong[st[top]] = color] |= dp[st[top]];
			--top;
		}
		--top;
	}
}
inline void _main()
{
	cin >> n >> m >> q;
	for (int i = 1; i <= m; ++i)
	{
		int u, v;
		cin >> u >> v;
		add_edge((u % n + n) % n, ((u + v) % n + n) % n, v);
	}
	for (int i = 0; i < n; ++i)
		if (!dfn[i])
			tarjan(i);
	for (int i = 0; i < n; ++i)
	{
		int x;
		cin >> x;
		cout << (answer[belong[(x % n + n) % n]] ? "Yes\n" : "No\n");
	}
	num_edge = color = dfstime = 0;
	for (int i = 0; i < n; ++i)
	{
		belong[i] = 0;
		head[i] = 0;
		answer[i] = dp[i] = 0;
		dis[i] = 0;
	}
}
signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	int test = 1;
//	cin >> test;
	while (test--)
		_main();
	return 0;
}