#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int h, w, q;
  cin >> h >> w >> q;
  int a[q], b[q];
  for (int i = 0; i < (q); ++i) cin >> a[i] >> b[i];
  for (int _ = 0; _ < (1); ++_) {
    int m = q;
    vector<int> G[w];
    for (int i = 0; i < (m); ++i) {
      G[(b[i] - 1) / 2].push_back(a[i]);
    }
    for (int i = 0; i < (w); ++i) sort(G[i].begin(), G[i].end());
    int flag = 1;
    int now = h;
    for (int i = 0; i < (w); ++i) {
      for (int j = 0; j < (((int)G[i].size() - 1)); ++j) {
        if (G[i][j] % 2 == 1 && G[i][j + 1] == G[i][j] + 1) {
          flag = 0;
          break;
        }
      }
      if (flag == 0) break;
      for (int j = 0; j < (G[i].size()); ++j) {
        int y = G[i][j];
        if (y % 2 == 0) {
          if (now * 2 >= y) {
            ;
          } else {
            flag = 0;
            break;
          }
        } else {
          if (now * 2 < y) {
            ;
          } else {
            now = y / 2;
          }
        }
      }
      if (flag == 0) break;
    }
    if (flag) {
      for (int i = 0; i < (q); ++i) cout << "YES" << endl;
      return 0;
    }
  }
  int l = 0, r = q;
  while (l + 1 < r) {
    int m = (l + r) / 2;
    vector<int> G[w];
    for (int i = 0; i < (m); ++i) {
      G[(b[i] - 1) / 2].push_back(a[i]);
    }
    for (int i = 0; i < (w); ++i) sort(G[i].begin(), G[i].end());
    int flag = 1;
    int now = h;
    for (int i = 0; i < (w); ++i) {
      for (int j = 0; j < (((int)G[i].size() - 1)); ++j) {
        if (G[i][j] % 2 == 1 && G[i][j + 1] == G[i][j] + 1) {
          flag = 0;
          break;
        }
      }
      if (flag == 0) break;
      for (int j = 0; j < (G[i].size()); ++j) {
        int y = G[i][j];
        if (y % 2 == 0) {
          if (now * 2 >= y) {
            ;
          } else {
            flag = 0;
            break;
          }
        } else {
          if (now * 2 < y) {
            ;
          } else {
            now = y / 2;
          }
        }
      }
      if (flag == 0) break;
    }
    if (flag == 1) {
      l = m;
    } else {
      r = m;
    }
  }
  for (int i = 0; i < (q); ++i) {
    if (i < l) {
      puts("YES");
    } else {
      puts("NO");
    };
  }
  return 0;
}
