#include <bits/stdc++.h>
using namespace std;
long long MOD = 1e9 + 7;
long long power(long long a, long long b) {
  a %= MOD;
  long long res = 1;
  while (b > 0) {
    if (b & 1) res = res * a % MOD;
    a = a * a % MOD;
    b >>= 1;
  }
  return res;
}
long long isvalley(long long a[], long long i) {
  if (a[i] > a[i - 1] && a[i] > a[i + 1]) {
    return 2;
  } else if (a[i] < a[i - 1] && a[i] < a[i + 1]) {
    return 1;
  }
  return 0;
}
long long cmp(pair<long long, long long> a, pair<long long, long long> b) {
  if (max(a.first, a.second) <= max(b.first, b.second)) {
    return 1;
  }
  return 0;
}
void tc() {
  long long n, d;
  cin >> n >> d;
  long long e;
  cin >> e;
  while (e--) {
    long long x, y;
    cin >> x >> y;
    long long p = x + y - d;
    long long q = x + y + d - 2 * n;
    long long r = x - y + d;
    long long s = x - y - d;
    vector<long long> v;
    v.push_back(p);
    v.push_back(q);
    v.push_back(r);
    v.push_back(s);
    for (long long& x : v) {
      if (x <= 0) {
        x = 0;
      } else {
        x = 1;
      }
    }
    if (!p || !q || !r || !s) {
      cout << "Yes" << endl;
      continue;
    }
    vector<long long> v1{0, 0, 1, 1}, v2{1, 1, 0, 0}, v3{1, 0, 0, 1},
        v4{0, 1, 1, 0};
    long long flag = 0;
    for (long long i = 0; i < 4; i++) {
      if (v[0] == v1[i] && v[1] == v2[i] && v[2] == v3[i] && v[3] == v4[i]) {
        flag = 1;
        cout << "Yes" << endl;
        break;
      }
    }
    if (!flag) cout << "No" << endl;
  }
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long t;
  t = 1;
  while (t--) {
    tc();
  }
}
