#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
using i32 = int;
using i64 = long long;
using i128=__int128;
const int N = 5e5 + 10;
#define endl "\n"
bool ok[N];
int n, m , q;
vector<int > e[N];
vector<int > e2[N];
int du[N];
int du2[N];
void topu()
{
    queue<int > q;
    vector<bool > st(n + 10);
    for(int i = 0 ; i < n ; i++)
        if(du[i] == 0) q.push(i) , st[i] = 1;
    while(!q.empty())
    {
        int tmp = q.front();
        q.pop();
        for(int v : e[tmp])
        {
            du[v]--;
            if(du[v] == 0)
                st[v] = 1 ,q.push(v);
        }
    }
    for(int i = 0 ; i < n ; i++)
        if((!st[i]) && du2[i]) ok[i] = 1;
    for(int i = 0 ; i < n ; i++)
        if(ok[i])
            q.push(i);
    while(!q.empty())
    {
        int tmp = q.front();
        q.pop();
        for(int v : e2[tmp])
            if(!ok[v])
                ok[v] = 1, q.push(v);
    }
}
void solve()
{
    cin >> n >> m >> q;
    for(int i = 1 ; i <= m ; i++)
    {
        int a, b;
        cin >> a >> b;
        a = ((a % n) + n) % n;
        if(b != 0) du2[a]++;
        b = (a + b) % n;
        e[a].push_back(b);
        du[b]++;
        e2[b].push_back(a);
    }
    topu();
    while(q--)
    {
        int tmp;
        cin >> tmp;
        tmp = ((tmp % n) + n) % n;
        if(ok[tmp])
            cout << "Yes" << endl;
        else 
            cout << "No" << endl;
    }
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    i32 t=1;
    while(t--) solve();
}