#include <bits/stdc++.h>
using namespace std;
#define int long long

signed main()
{
#ifndef ONLINE_JUDGE
    freopen("in.txt", "rt", stdin);
    freopen("out.txt", "wt", stdout);
#endif
    int n, m, q;
    scanf("%lld%lld%lld", &n, &m, &q);

    vector<vector<pair<int, int>>> to2(n);
    vector<vector<int>> to(n), rto(n);
    for (int i = 1; i <= m; i++)
    {
        int a, b;
        scanf("%lld%lld", &a, &b);
        to2[(a % n + n) % n].push_back({((a + b) % n + n) % n, b});
        to2[((a + b) % n + n) % n].push_back({(a % n + n) % n, -b});
        to[((a + b) % n + n) % n].push_back((a % n + n) % n);
        rto[(a % n + n) % n].push_back(((a + b) % n + n) % n);
    }

    vector<int> c(n);
    {
        vector<int> s, vis(n);
        int cnt = 0;
        auto dfs1 = [&](auto self, int u) -> void
        {
            s.push_back(u);
            vis[u] = 1;
            for (auto v : to[u])
            {
                if (!vis[v])
                    self(self, v);
            }
        };
        auto dfs2 = [&](auto self, int u) -> void
        {
            c[u] = cnt;
            for (auto v : rto[u])
                if (!c[v])
                    self(self, v);
        };
        auto scc = [&]() -> void
        {
            for (int i = 0; i < n; i++)
            {
                if (!vis[i])
                    dfs1(dfs1, i);
            }
            for (int i = 0; i <= n - 1; i ++)
            {
                if (!c[s[i]])
                {
                    cnt++;
                    dfs2(dfs2, s[i]);
                }
            }
        };
        scc();
    }

    vector<int> vis(n), dis(n), ans(n + 1);
    function<void(int, int)> dfs = [&](int i, int ci)
    {
        vis[i] = 1;
        for (auto [v, w] : to2[i])
            if (ci == c[v])
            {
                if (!vis[v])
                    dis[v] = dis[i] + w, dfs(v, ci);
                else if (dis[v] != dis[i] + w)
                    ans[v] = ans[i] = 1;
            }
    };
    function<void(int)> dfsa = [&](int i)
    {
        ans[i] = 1;
        for (int v : to[i])
            if (!ans[v])
                dfsa(v);
    };
    for (int i = 0; i < n; i++)
        if (!vis[i])
            dfs(i, c[i]);
    for (int i = 0; i < n; i++)
        if (ans[i])
            dfsa(i);

    while (q--)
    {
        int x;
        scanf("%lld", &x);
        puts(ans[(x % n + n) % n] == 1 ? "Yes" : "No");
    }
}