#include <bits/stdc++.h>
using namespace std;
template <typename T>
void out(T x) {
  cout << x << endl;
  exit(0);
}
using ll = long long;
const ll mod = 1e9 + 7;
const int maxn = 1e6 + 5;
const int inf = 1e9;
int n, m, k;
int x[maxn], y[maxn];
bool test(int mid) {
  vector<int> premin(n + 3, inf);
  for (int i = 0; i <= mid; i++) {
    if (x[i] % 2) {
      premin[x[i] / 2 + 1] = min(premin[x[i] / 2 + 1], y[i] / 2);
    }
  }
  for (int i = 1; i <= n; i++) {
    premin[i] = min(premin[i], premin[i - 1]);
  }
  for (int i = 0; i <= mid; i++) {
    if (x[i] % 2 == 0) {
      if (premin[x[i] / 2] < y[i] / 2) return false;
    }
  }
  return true;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m >> k;
  for (int i = 0; i < k; i++) {
    cin >> x[i] >> y[i];
  }
  int lo = 0;
  int hi = k;
  while (hi - lo > 1) {
    int mid = (lo + hi) / 2;
    if (test(mid)) {
      lo = mid;
    } else {
      hi = mid;
    }
  }
  for (int i = 0; i <= lo; i++) {
    cout << "YES\n";
  }
  for (int i = lo + 1; i < k; i++) {
    cout << "NO\n";
  }
  return 0;
}
