#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200005;
template <typename T>
inline void read(T &AKNOI) {
  T x = 0, flag = 1;
  char ch = getchar();
  while (!isdigit(ch)) {
    if (ch == '-') flag = -1;
    ch = getchar();
  }
  while (isdigit(ch)) {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  AKNOI = flag * x;
}
int n, m, q;
set<int> ban[MAXN << 1], S1[MAXN], S2[MAXN];
int mn[MAXN << 2], mx[MAXN << 2], seg[MAXN << 2];
void Build(int rt, int b, int e) {
  mn[rt] = m + 1;
  mx[rt] = 0;
  if (b == e) return;
  int mid = (b + e) >> 1;
  Build((rt << 1), b, mid);
  Build((rt << 1) | 1, mid + 1, e);
}
void Update(int rt, int b, int e, int p) {
  if (b == e) {
    mn[rt] = (S1[p].empty() ? m + 1 : *S1[p].begin());
    mx[rt] = (S2[p].empty() ? 0 : *S2[p].rbegin());
    seg[rt] = (mn[rt] <= mx[rt]);
    return;
  }
  int mid = (b + e) >> 1;
  if (p <= mid)
    Update((rt << 1), b, mid, p);
  else
    Update((rt << 1) | 1, mid + 1, e, p);
  mn[rt] = min(mn[(rt << 1)], mn[(rt << 1) | 1]);
  mx[rt] = max(mx[(rt << 1)], mx[(rt << 1) | 1]);
  seg[rt] = seg[(rt << 1)] | seg[(rt << 1) | 1];
  seg[rt] |= (mn[(rt << 1)] <= mx[(rt << 1) | 1]);
}
void solve() {
  read(n);
  read(m);
  read(q);
  Build(1, 1, n);
  while (q--) {
    int x, y;
    read(x);
    read(y);
    int bx = (x + 1) / 2, by = (y + 1) / 2;
    if (ban[x].find(y) != ban[x].end()) {
      ban[x].erase(y);
      if (x & 1) {
        S1[bx].erase(by);
      } else {
        S2[bx].erase(by);
      }
    } else {
      ban[x].insert(y);
      if (x & 1) {
        S1[bx].insert(by);
      } else {
        S2[bx].insert(by);
      }
    }
    Update(1, 1, n, bx);
    puts(seg[1] ? "NO" : "YES");
  }
}
int main() {
  solve();
  return 0;
}
