#include <bits/stdc++.h>
using namespace std;
inline int read() {
  char c = getchar();
  int x = 0;
  bool f = 0;
  for (; !isdigit(c); c = getchar()) f ^= !(c ^ 45);
  for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
  if (f) x = -x;
  return x;
}
int n, m, Q;
int mx[1000005 << 2], mn[1000005 << 2];
set<int> rs[1000005 << 2], ls[1000005 << 2], mp[1000005];
bool ok[1000005 << 2];
inline void pushup(int p) {
  mx[p] = max(mx[p << 1], mx[p << 1 | 1]);
  mn[p] = min(mn[p << 1], mn[p << 1 | 1]);
  ok[p] = ok[p << 1] & ok[p << 1 | 1] & (mx[p << 1 | 1] < mn[p << 1]);
}
void modify(int p, int l, int r, int x) {
  if (l == r) {
    mx[p] = rs[l].empty() ? 0 : *rs[l].rbegin();
    mn[p] = ls[l].empty() ? m + 1 : *ls[l].begin();
    ok[p] = (mx[p] < mn[p]);
    return;
  }
  int mid = l + r >> 1;
  x <= mid ? modify(p << 1, l, mid, x) : modify(p << 1 | 1, mid + 1, r, x);
  pushup(p);
}
int main() {
  n = read(), m = read(), Q = read();
  memset(ok, 1, sizeof ok);
  for (register int i = (1); i <= (4 * n); ++i) mx[i] = 0, mn[i] = m + 1;
  while (Q--) {
    int x = read() + 1, y = read() + 1;
    if (mp[x].count(y)) {
      mp[x].erase(y);
      if (y & 1)
        rs[x >> 1].erase(y >> 1);
      else
        ls[x >> 1].erase(y >> 1);
    } else {
      mp[x].insert(y);
      if (y & 1)
        rs[x >> 1].insert(y >> 1);
      else
        ls[x >> 1].insert(y >> 1);
    }
    modify(1, 1, n, x >> 1);
    puts(ok[1] ? "YES" : "NO");
  }
  return 0;
}
