#include <bits/stdc++.h>
using namespace std;
const int M = 2e5 + 5;
int n, m, q;
struct node {
  int x, y, op;
} a[M], b[M];
int cmp(node A, node B) {
  if (A.x != B.x) return A.x < B.x;
  if (A.y != B.y) return A.y < B.y;
  return A.op < B.op;
}
int check(int x) {
  memcpy(a, b, sizeof(node) * (x + 1));
  sort(a + 1, a + x + 1, cmp);
  int now = m + 1;
  for (int i = 1; i <= x; i++) {
    if (a[i].op == 1) {
      now = min(now, a[i].y);
    } else if (a[i].y >= now)
      return 0;
  }
  return 1;
}
int main() {
  scanf("%d%d%d", &n, &m, &q);
  for (int i = 1; i <= q; i++) scanf("%d%d", &b[i].x, &b[i].y);
  for (int i = 1; i <= q; i++) {
    if (b[i].x & 1)
      b[i].x = b[i].x / 2 + 1, b[i].y = b[i].y / 2 + 1, b[i].op = 1;
    else
      b[i].x = b[i].x / 2, b[i].y = b[i].y / 2, b[i].op = 2;
  }
  int l = 1, r = q, mid;
  while (l < r) {
    mid = l + r + 1 >> 1;
    if (check(mid))
      l = mid;
    else
      r = mid - 1;
  }
  for (int i = 1; i <= l; i++) puts("YES");
  for (int i = l + 1; i <= q; i++) puts("NO");
  return 0;
}
