#include<bits/stdc++.h>
using namespace std;
#define int long long
void solve()
{

}

signed main()
{
    int n, m, q;
    scanf("%lld%lld%lld", &n, &m, &q);

    vector<pair<int, int>> op(m + 1);
    vector<vector<pair<int,int>>>to2(n);
    vector<vector<int>>to(n);
    auto f=[&](int i)
    {
        if(i>=0)return i/n;
        return (i+1)/n-1;
    };
    for (int i = 1; i <= m; i++) {
        int a, b;
        scanf("%lld%lld", &a, &b);
        op[i] = {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);
    }
    vector<int>vis(n),dis(n),ans(n+1);
    function<void(int)>dfs=[&](int i)
    {
        vis[i]=1;
        for(auto [v,w]:to2[i])
            if(!vis[v])dis[v]=dis[i]+w,dfs(v);
            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);
    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");
    }
}