#include <bits/stdc++.h>
const int MOD = 1e12 + 7;
const int MAX = 1e6 + 2;
const int INF = 0x3f3f3f3f;
long long gcd(long long a, long long b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
long long expo(int x, int y) {
  int res = 1;
  while (y) {
    if (y % 2) res = (res * x % MOD) % MOD;
    x = (x * x) % MOD;
    y /= 2;
  }
  return res;
}
bool isPerSquare(long double a) {
  if (a < 0) return false;
  long long sr = sqrt(a);
  return (sr * sr == a);
}
bool IsPrime(long long x) {
  if (x < 2) {
    return false;
  }
  for (long long p = 2; p * p <= x; ++p)
    if (x % p == 0) return false;
  return true;
}
using namespace std;
int main() {
  long long n, m, d, x, y;
  cin >> n >> d;
  cin >> m;
  while (m--) {
    cin >> x >> y;
    if (d <= x + y && x + y <= 2 * n - d && -d <= x - y && x - y <= d) {
      cout << "YES" << endl;
      ;
    } else
      cout << "NO" << endl;
    ;
  }
  return 0;
}
