#include <bits/stdc++.h>
const int N = 3e5 + 5;
using namespace std;
int n, m, q;
set<int> L[N], R[N];
set<int>::iterator it;
map<pair<int, int>, int> Map;
struct SegTree {
  struct Tree {
    int mn, mx, flag;
  } t[N << 2];
  void pushup(int p) {
    t[p].mn = min(t[p << 1].mn, t[p << 1 | 1].mn);
    t[p].mx = max(t[p << 1].mx, t[p << 1 | 1].mx);
    t[p].flag = t[p << 1].flag | t[p << 1 | 1].flag |
                (t[p << 1 | 1].mx >= t[p << 1].mn);
  }
  void build(int p, int l, int r) {
    t[p].mn = m + 1, t[p].mx = 0;
    if (l == r) return;
    int mid = (l + r) >> 1;
    build(p << 1, l, mid), build(p << 1 | 1, mid + 1, r);
    pushup(p);
  }
  void modify(int p, int l, int r, int k) {
    if (l == r) {
      if (L[l].size())
        it = L[l].begin(), t[p].mn = *it;
      else
        t[p].mn = m + 1;
      if (R[l].size())
        it = R[l].end(), it--, t[p].mx = *it;
      else
        t[p].mx = 0;
      t[p].flag = t[p].mx >= t[p].mn;
      return;
    }
    int mid = (l + r) >> 1;
    if (k <= mid)
      modify(p << 1, l, mid, k);
    else
      modify(p << 1 | 1, mid + 1, r, k);
    pushup(p);
  }
} T;
template <typename T>
inline T read() {
  T x = 0, w = 1;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') w = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
  return x * w;
}
int main() {
  n = read<int>(), m = read<int>(), q = read<int>();
  T.build(1, 1, n);
  int x, y;
  while (q--) {
    x = read<int>(), y = read<int>(), x++, y++;
    if (Map.find(make_pair(x, y)) == Map.end()) Map[make_pair(x, y)] = 0;
    if (Map[make_pair(x, y)]) {
      if (x & 1)
        R[x >> 1].erase(y >> 1);
      else
        L[x >> 1].erase(y >> 1);
    } else {
      if (x & 1)
        R[x >> 1].insert(y >> 1);
      else
        L[x >> 1].insert(y >> 1);
    }
    Map[make_pair(x, y)] ^= 1;
    T.modify(1, 1, n, x >> 1);
    puts(T.t[1].flag ? "NO" : "YES");
  }
  return 0;
}
