#include <bits/stdc++.h>
using namespace std;
const long long maxn = 4e5 + 5;
long long t1[4 * maxn];
void to1(long long node, long long tl, long long tr, long long l, long long r,
         long long x) {
  if (tl >= l && tr <= r) {
    t1[node] = max(t1[node], x);
    return;
  }
  if (tl >= r || tr <= l) {
    return;
  }
  long long tm = (tl + tr) / 2;
  to1(2 * node + 1, tl, tm, l, r, x);
  to1(2 * node + 2, tm, tr, l, r, x);
}
long long get1(long long node, long long tl, long long tr, long long l,
               long long r, long long curr = (-1e18)) {
  if (tl >= l && tr <= r) {
    return t1[node];
  }
  if (tl >= r || tr <= l) {
    return curr;
  }
  long long tm = (tl + tr) / 2;
  curr = max(curr, t1[node]);
  return max(get1(2 * node + 1, tl, tm, l, r, curr),
             get1(2 * node + 2, tm, tr, l, r, curr));
}
long long t2[4 * maxn];
void to2(long long node, long long tl, long long tr, long long l, long long r,
         long long x) {
  if (tl >= l && tr <= r) {
    t2[node] = min(t2[node], x);
    return;
  }
  if (tl >= r || tr <= l) {
    return;
  }
  long long tm = (tl + tr) / 2;
  to2(2 * node + 1, tl, tm, l, r, x);
  to2(2 * node + 2, tm, tr, l, r, x);
}
long long get2(long long node, long long tl, long long tr, long long l,
               long long r, long long curr = 1e18) {
  if (tl >= l && tr <= r) {
    return t2[node];
  }
  if (tl >= r || tr <= l) {
    return curr;
  }
  long long tm = (tl + tr) / 2;
  curr = min(curr, t2[node]);
  return min(get2(2 * node + 1, tl, tm, l, r, curr),
             get2(2 * node + 2, tm, tr, l, r, curr));
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  for (long long i = 0; i < 4 * maxn; ++i) {
    t1[i] = (-1e18);
    t2[i] = 1e18;
  }
  long long n, m, q;
  cin >> n >> m >> q;
  bool ans = true;
  while (q--) {
    long long x, y;
    cin >> x >> y;
    if (x % 2 == 0) {
      to1(0, 0, maxn, 0, x, y);
    } else {
      to2(0, 0, maxn, x, maxn, y);
    }
    if (x % 2 == 0) {
      if (get2(0, 0, maxn, x, x + 1) < y) {
        ans = false;
      }
    } else {
      if (get1(0, 0, maxn, x, x + 1) >= y) {
        ans = false;
      }
    }
    if (ans) {
      cout << "YES" << endl;
    } else {
      cout << "NO" << endl;
    }
  }
  return 0;
}
