//////////////////////////
// Author: lnyxj
// Time: 2024-11-27 16:20:18
///////////////////////////
#include <bits/stdc++.h>
#define xx first
#define yy second
// #define int long long
// #define double long double
using namespace std;
const int N = 5e5 + 5, mod = 998244353, inv2 = mod + 1 >> 1, inf = 0x3f3f3f3f;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef long long ll;

int n, m, qs;
int a[N];

int num, h[N], to[N], w[N], nxt[N];
inline void adde(int x, int y, int z) { ++ num; nxt[num] = h[x]; w[num] = z; to[num] = y; h[x] = num; }

stack<int> stk;
int low[N], pre[N], dfn;
int col[N], cnt;
bool tst[N];

bool solvec(const vector<int>& pts) {
	static vector<pii> edgs[N];
	static bool vis[N];
	static int dis[N];
	for (int v : pts) {
		dis[v] = -1; vis[v] = 0;
		for (int i = h[v]; i; i = nxt[i]) 
			if (col[to[i]] == col[v]) edgs[v].push_back({to[i], w[i]});
	}
	priority_queue<pii, vector<pii>, greater<pii> > q;
	q.push({pts[0], dis[pts[0]] = 0});
	while (!q.empty()) {
		const auto [x, d] = q.top(); q.pop();
		if (vis[x]) continue;
		vis[x] = 1;
		for (auto [y, w] : edgs[x]) {
			if (dis[y] == -1) dis[y] = d + w;
			else if (dis[y] != d + w) return 1;
		}
	}
	return 0;
}

void tarjan(int x) {
	stk.push(x);
	low[x] = pre[x] = ++ dfn;
	for (int i = h[x]; i; i = nxt[i]) {
		const int y = to[i];
		if (!pre[y]) {
			tarjan(y);
			low[x] = min(low[x], low[y]);
		} else low[x] = min(low[x], pre[y]);
	}
	if (low[x] >= pre[x]) {
		int p = -1; ++ cnt;
		vector<int> cur;
		while (p != x) {
			p = stk.top(); stk.pop();
			col[p] = cnt;
			cur.push_back(p);
		}
		tst[cnt] = solvec(cur);
	}
}

void solve() {
	cin >> n >> m >> qs;
	for (int i = 1, x, y; i <= m; ++ i) {
		cin >> x >> y;
		adde(((x % n) + n) % n, ((x + y) % n + n) % n, y);
	}
	for (int i = 0; i < n; ++ i) 
		if (!pre[i]) tarjan(i);
	static vector<int> edgx[N];
	static int d[N];
	for (int i = 0; i < n; ++ i) {
		for (int j = h[i]; j; j = nxt[j]) {
			const int p = to[j];
			if (col[i] != col[p]) {
				edgx[col[p]].push_back(col[i]);
				++ d[col[i]];
			}
		}
	}
	queue<int> q;
	for (int i = 1; i <= cnt; ++ i) 
		if (!d[i]) q.push(i);
	while (!q.empty()) {
		const int x = q.front(); q.pop();
		for (int y : edgx[x]) {
			-- d[y];
			tst[y] |= tst[x];
			if (!d[y]) 
				q.push(y);
		}
	}
	for (int i = 1, x; i <= qs; ++ i) 
		cin >> x, cout << "No\n\0Yes\n" + (tst[col[(x % n + n) % n]]) * 4;
}

signed main() {
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	int T = 1;
	while (T --) solve();
	return 0;
}