#include <bits/stdc++.h>
#define int long long
#define rep(i, s, e) for (int i = s; i <= e; i++)
using namespace std;
const int N = 1e6 + 10;
vector<int> e[N], sta, com[N], ie[N];
int n, m, q, dfn[N], low[N], f[N], vis[N], dfsOrder, sccnum, ok[N], val[N];
void tarjan(int u)
{
    dfn[u] = low[u] = ++dfsOrder;
    sta.push_back(u);
    vis[u] = 1;
    for (auto &v : e[u])
    {
        if (!dfn[v])
        {
            tarjan(v);
            low[u] = min(low[u], low[v]);
        }
        else if (vis[v])
            low[u] = min(low[u], dfn[v]);
    }
    if (dfn[u] != low[u])
        return;
    ++sccnum;
    vector<int>::iterator it = (--sta.end());
    for (f[u] = sccnum, vis[u] = 0; *it != u; --it)
        f[*it] = sccnum, vis[*it] = 0;
    sta.erase(it, sta.end());
}
struct edge
{
    int to, val;
};
vector<edge> g[N];
signed main()
{
    ios::sync_with_stdio(0), cin.tie(0);
    cin >> n >> m >> q;
    rep(i, 1, m)
    {
        int a, b;
        cin >> a >> b;
        int c = b;
        a = (a % n + n) % n, b = (b % n + n) % n;
        e[a + 1].push_back((a + b) % n + 1);
        ie[(a + b) % n + 1].push_back(a + 1);
        g[a + 1].push_back({(a + b) % n + 1, c});
    }
    rep(i, 1, n) if (!dfn[i]) tarjan(i);
    rep(i, 1, n)
    {
        com[f[i]].push_back(i);
    }
    rep(i, 1, n)
        vis[i] = 0;
    rep(i, 1, sccnum)
    {
        queue<int> Q;
        Q.push(com[i][0]);
        while (Q.size())
        {
            int t = Q.front();
            Q.pop();
            vis[t] = 1;
            for (auto [son, dis] : g[t])
            {
                if (f[son] != f[t])
                    continue;
                if (vis[son])
                {
                    if (val[son] != val[t] + dis)
                        ok[i] = 1;
                }
                else
                {
                    val[son] = val[t] + dis;
                    Q.push(son);
                }
            }
        }
        if (ok[i])
            for (int j : com[i])
            {
                for (int k : ie[j])
                {
                    ok[f[k]] = 1;
                }
            }
    }
    while (q--)
    {
        int x;
        cin >> x;
        x = (x % n + n) % n;
        cout << (ok[x + 1] ? "Yes" : "No") << endl;
    }
}