#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define all(x) x.begin(), x.end()
void solve()
{
    int n, m, q;
    cin >> n >> m >> q;
    vector<int> f(n), cyc(n);
    iota(all(f), 0ll);
    auto find = [&](auto find, int x) -> int
    {
        return f[x] == x ? f[x] : f[x] = find(find, f[x]);
    };
    for (int i = 0; i < m; i++)
    {
        int a, b;
        cin >> a >> b;
        a = (a % n + n) % n;
        if(b==0)continue;
        b = (b % n + n) % n;
        b = (b + a) % n;
        a = find(find, a), b = find(find, b);
        if (a == b)
            cyc[a] = 1;
        f[a] = b;
    }
    for (int i = 0; i < q; i++)
    {
        int x;
        cin >> x;
        x = (x % n + n) % n;
        if (cyc[find(find, 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
*/