#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define all(x) x.begin(), x.end()
#define int long long
void solve()
{
    int n, m, q;
    cin >> n >> m >> q;
    vector<int> f(n), ok(n, 1);
    iota(all(f), 0ll);
    auto find = [&](auto find, int x) -> int
    {
        return f[x] == x ? f[x] : f[x] = find(find, f[x]);
    };
    vector<int> in(n), out(n);
    vector<vector<pair<int, int>>> e(n);
    vector<vector<pair<int, int>>> g(n);
    for (int i = 0; i < m; i++)
    {
        int a, b;
        cin >> a >> b;
        int w = b;
        a = (a % n + n) % n;
        if (b == 0)
            continue;
        b = (b % n + n) % n;
        b = (b + a) % n;
        e[a].push_back({b, w});
        g[b].push_back({a, w});
        in[b]++;
        out[a]++;
    }
    {
        queue<int> q;
        vector<i64> dep(n);
        vector<int> vis(n);
        function<void(int)> tarjan = [&](int x)
        {
            vis[x] = 1;
            for (auto [y, w] : e[x])
            {
                if (vis[y])
                {
                    if (w + dep[x] - dep[y] != 0)
                        q.push(x);
                }
                else
                {
                    dep[y] = dep[x] + w;
                    tarjan(y);
                }
            }
            vis[x] = 0;
        };
        for (int i = 0; i < n; i++)
            if (!vis[i])
                tarjan(i);
        ok.assign(n, 0);
        while (!q.empty())
        {
            int x = q.front();
            q.pop();
            if (ok[x] != 0)
                continue;
            ok[x] = 1;
            for (auto [y, w] : g[x])
            {
                if (ok[y])
                    continue;
                ok[y] = 1;
                q.push(y);
            }
        }
    }
    for (int i = 0; i < q; i++)
    {
        int x;
        cin >> x;
        x = (x % n + n) % n;
        if (ok[x])
            cout << "Yes\n";
        else
            cout << "No\n";
    }
}
signed main()
{
    std::ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int T = 1;
    while (T--)
        solve();
}
/*
 3 2 3
 1 1
 -1 0
 1
 2
 3
*/