#include <bits/stdc++.h>
using namespace std;
using namespace chrono;

using ll = long long;
using ull = unsigned long long;

string to_string(const string &s) {
  return '"' + s + '"';
}

string to_string(bool b) {
  return b ? "true" : "false";
}

template <typename A, typename B>
string to_string(const pair<A, B> &p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename T>
string to_string(const T &v) {
  string s = "{";
  bool first = true;
  for (const auto &it : v) {
    if (!first)
      s += ", ";
    else
      first = false;
    s += to_string(it);
  }
  return s += "}";
}

void debug_out() {
  cerr << endl;
}

template <typename T, typename... Args>
void debug_out(const T &first, const Args&... rest) {
  cerr << to_string(first) << " ";
  debug_out(rest...);
}

#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

auto startTime = high_resolution_clock::now();
int get_time() {
  auto stopTime = chrono::high_resolution_clock::now();
  auto duration = duration_cast<milliseconds>(stopTime - startTime);
  return duration.count(); // in ms
}

const int DIM = 5e5 + 5;
const ll INF = 1e18;

bool cyc[DIM];
int viz[DIM];
int nr;
int low[DIM], lim[DIM];
int wh[DIM];
vector<pair<int, int>> v[DIM];
vector<pair<int, int>> vt[DIM];
vector<vector<int>> ctc;
stack<int> st;

void dfs(int nod) {
  viz[nod] = 1;
  low[nod] = lim[nod] = ++nr;
  st.push(nod);

  for (auto it : v[nod]) {
    if (!viz[it.first]) {
      dfs(it.first);
      low[nod] = min(low[nod], low[it.first]);
    } else {
      low[nod] = min(low[nod], lim[it.first]);
    }
  }

  if (low[nod] == lim[nod]) {
    ctc.emplace_back();
    int x;
    do {
      x = st.top();
      st.pop();

      viz[x] = 2;
      wh[x] = ctc.size();
      ctc.back().push_back(x);
    } while (x != nod);
  }
}

void dfs2(int nod) {
  viz[nod] = 3;
  for (auto it : v[nod]) {
    if (viz[it.first] < 3) {
      dfs2(it.first);
    }
    cyc[nod] |= cyc[it.first];
  }
  viz[nod] = 4;
}

int f[DIM];
ll sum[DIM];

bool dfs3(int nod) {
  f[nod] = 1;
  for (auto it : vt[nod]) {
    if (wh[it.first] != wh[nod])
      continue;

    if (f[it.first]) {
      if (sum[it.first] != sum[nod] + it.second)
        return true;
    } else {
      sum[it.first] = sum[nod] + it.second;
      bool r = dfs3(it.first);
      if (r)
        return true;
    }
  }

  f[nod] = 2;
  return false;
}

void solve() {
  int n, m, q;
  cin >> n >> m >> q;

  for (int i = 1; i <= m; ++i) {
    int a, b, x, y;
    cin >> a >> b;
    if (b == 0)
      continue;
    x = (a % n + n) % n;
    y = ((a + b) % n + n) % n;

    v[x].push_back({y, b});
    vt[x].push_back({y, b});
    vt[y].push_back({x, -b});
  }

  for (int i = 0; i < n; ++i) {
    if (!viz[i]) {
      dfs(i);
    }
  }

  for (auto &c : ctc) {
    if (dfs3(c[0])) {
      for (auto nod : c) {
        cyc[nod] = 1;
      }
    }
  }

  for (int i = 0; i < n; ++i) {
    if (viz[i] < 3)
      dfs2(i);
  }

  for (int i = 1; i <= q; ++i) {
    int x;
    cin >> x;
    x = (x % n + n) % n;
    if (cyc[x]) {
      cout << "Yes\n";
    } else {
      cout << "No\n";
    }
  }
}

int main() {
  cin.tie(NULL);
  ios_base::sync_with_stdio(false);

  int t = 1;
//  cin >> t;
  while (t--)
    solve();

  return 0;
}