#include<bits/stdc++.h>
// #define int long long
#define endl '\n'
using namespace std;
#define rep(i, a, b) for(int i = a; i <= b; i ++ )
#define pre(i, a, b) for(int i = a; i >= b; i -- )
const int N = 3e6 + 10, M = 3e6 + 10;
int stk[M], e[N], w[N], ne[N], h[M], hs[M], idx, top, cnt, id[M], n, m, p, dfn[M], low[M], times, f[M], g[M], sz[M], dep[N];
bool in_stk[M], ff[N], fff[N];
int qq, stt[N];
void add(int a, int b, int ww)
{
    w[idx] = ww, e[idx] = b, ne[idx] = h[a], h[a] = idx ++ ;
}
void tarjan(int u)
{
    dfn[u] = low[u] = ++ times;
    stk[++top] = u, in_stk[u] = true;
    for(int i = h[u]; i != -1; i = ne[i])
    {
        int j = e[i];
        if(!dfn[j])
        {
            dep[j] = dep[u] + w[i];
            tarjan(j);
            low[u] = min(low[u], low[j]);
        }
        else if(in_stk[j])
        {
            if(dep[j] != dep[u] + w[i])
            {
                ff[j] = 1;
            }
            low[u] = min(low[u], dfn[j]);
        }
    }
    if(dfn[u] == low[u])
    {
        cnt ++ ;
        int y;
        do
        {
            y = stk[top -- ];
            id[y] = cnt;
            sz[cnt] ++ ;
            in_stk[y] = false;
        }while(y != u);
    }
}
vector<int>pp[N];
int main()
{
    ios::sync_with_stdio(false);
    cin.tie();
    cout.tie();
    rep(i, 0, 201000) h[i] = -1;
    cin >> n >> m >> qq;
    rep(i, 1, m)
    {
        int a, b;
        cin >> a >> b;
        int u = (a % n + n) % n;
        int v = ((a + b) % n + n) % n;
        // cout<<u<<" "<<v<<endl;
        add(u, v, b);
    }
    rep(i, 0, n - 1) if(!dfn[i]) tarjan(i);
    queue<int>q;
    rep(i, 0, n - 1)
    {
        if(ff[i]) q.push(id[i]);
    }
    rep(u, 0, n - 1)
    {
        for(int i = h[u]; i != -1; i = ne[i])
        {
            int j = e[i];
            pp[id[j]].push_back(id[u]);
        }
    }
    while(q.size())
    {
        int u = q.front();
        q.pop();
        fff[u] = 1;
        for(auto j : pp[u])
        {
            if(fff[j]) continue;
            fff[j] = 1;
            q.push(j);
        }
    }
    while(qq -- )
    {
        int x;
        cin >> x;
        x = (x % n + n) % n;
        if(fff[id[x]]) cout << "Yes" << endl;
        else cout << "No" << endl;
    }
    return 0;
}