#include <bits/stdc++.h>
using namespace std;
const long long INF = 1000000007;
const long long INFL = 1000000000000000007;
const long double INFS = 0.00000001;
const long long MOD = 1000000007;
const long double PI = 3.14159265;
int n, m, q;
pair<int, int> a[200001];
int Min[400001], Max[400001];
int ok(int x) {
  int i;
  for (i = 1; i <= 400000; i++) Min[i] = INF, Max[i] = 0;
  for (i = 1; i <= x; i++) {
    Min[a[i].first] = min(Min[a[i].first], a[i].second);
    Max[a[i].first] = max(Max[a[i].first], a[i].second);
  }
  int last = INF;
  for (i = 1; i <= n; i++) {
    if (Min[2 * i - 1] <= Max[2 * i] || Max[2 * i] >= last) return 0;
    last = min(last, Min[2 * i - 1] + 1);
  }
  return 1;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int i;
  cin >> n >> m >> q;
  for (i = 1; i <= q; i++) cin >> a[i].first >> a[i].second;
  int lo = 1, hi = q + 1, mi;
  while (lo < hi) {
    mi = (lo + hi) / 2;
    if (ok(mi))
      lo = mi + 1;
    else
      hi = mi;
  }
  lo--;
  for (i = 1; i <= lo; i++) cout << "YES" << endl;
  for (i = lo + 1; i <= q; i++) cout << "NO" << endl;
  return 0;
}
