#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
using i32 = int;
using i64 = long long;
using i128 = __int128;
#define int long long
const int N = 5e5 + 10;
#define endl "\n"
bool ok[N];
int n, m, q;
vector<pair<int, int>> e[N];
vector<int> e2[N];
bool st[N];
int du[N];
int du2[N];
bool spfa(int s)
{
    vector<bool> inq(n + 10);
    vector<int> dis(n + 10);
    vector<int> cnt(n + 10);
    for (int i = 0; i < n; i++)
        dis[i] = 0;
    priority_queue<pair<int ,int > > q;
    q.push({0 , s});
    inq[s] = 1;
    st[s] = 1;
    cnt[s] = 1;
    while (!q.empty())
    {
        auto tmp = q.top();
        int u = tmp.second;
        q.pop();
        inq[u] = 0;
        for (auto i : e[u])
        {
            int v = i.first;
            int val = i.second;
            if(v == s && dis[s] < 0) return true;
            if (dis[v] > dis[u] + val)
            {
                dis[v] = dis[u] + val;
                st[v] = 1;
                if (!inq[v])
                {
                    q.push({dis[v] , v});
                    inq[v] = 1;
                    cnt[v]++;
                    if (cnt[v] > n)
                        return true;
                }
            }
        }
    }
    return false;
}
bool tt[N];
bool ok2[N];
void topu()
{
    queue<int> q;
    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 (auto i : e[tmp])
        {
            int v = i.first;
            du[v]--;
            if (du[v] == 0)
                st[v] = 1, q.push(v);
        }
    }
    for(int i = 0 ; i < n ; i++)
        tt[i] = st[i];
    for (int i = 0; i < n; i++)
    {
        if (!st[i])
            if (spfa(i))
            {
                queue<int> q;
                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);
                }
            }
    }

    for(int i = 0 ; i < n ; i++)
        st[i] = tt[i];
    for(int i = 0 ; i < n; i++)
        for(auto &v : e[i])
            v.second = -v.second;

    for (int i = 0; i < n; i++)
    {
        if (!st[i])
            if (spfa(i))
            {
                queue<int> q;
                q.push(i);
                while (!q.empty())
                {
                    int tmp = q.front();
                    q.pop();
                    for (int v : e2[tmp])
                        if (!ok2[v])
                            ok2[v] = 1, q.push(v);
                }
            }
    }
    for(int i = 0 ; i < n ; i++)
        ok[i] = ok[i] || ok2[i];
} 

void solve()
{
    cin >> n >> m >> q;
    for (int i = 1; i <= m; i++)
    {
        int a, b;
        cin >> a >> b;
        int u = ((a % n) + n) % n  , v = ((u + b) % n + n) % n;
        if(b == 0) continue;
        du[v]++;
        e[u].push_back({v, b});
        e2[v].push_back(u);
    }
    topu();
    while (q--)
    {
        int tmp;
        cin >> tmp;
        tmp = ((tmp % n) + n) % n;
        if (ok[tmp])
            cout << "Yes" << endl;
        else
            cout << "No" << endl;
    }
}
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    i32 t = 1;
    while (t--)
        solve();
}