#include <bits/stdc++.h>
using namespace std;
const int mxn = 2e6 + 6;
multiset<int> ms[mxn];
set<pair<int, int> > S;
int n, m, Q, mn[mxn], mx[mxn], s[mxn], x, y, p[mxn];
void build(int o, int l, int r) {
  mn[o] = 2e9;
  if (l == r)
    p[l] = o;
  else {
    int md = l + r >> 1;
    build(o << 1, l, md), build(o << 1 | 1, md + 1, r);
  }
}
void upd() {
  int o = p[x], ls, rs;
  if (x & 1) {
    if (ms[x].size())
      mn[o] = *ms[x].begin();
    else
      mn[o] = 2e9;
  } else {
    if (ms[x].size())
      mx[o] = *ms[x].rbegin();
    else
      mx[o] = 0;
  }
  for (; o >>= 1;) {
    ls = o << 1, rs = ls | 1;
    s[o] = (s[ls] or s[rs] or (mn[ls] < mx[rs]));
    mn[o] = min(mn[ls], mn[rs]);
    mx[o] = max(mx[ls], mx[rs]);
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin >> n >> m >> Q;
  build(1, 1, n << 1);
  for (; Q--;) {
    cin >> x >> y;
    pair<int, int> now = {x, y};
    if (S.count(now)) {
      ms[x].erase(ms[x].find(y));
      S.erase(now);
      upd();
    } else {
      ms[x].insert(y);
      S.insert(now);
      upd();
    }
    if (s[1])
      puts("NO");
    else
      puts("YES");
  }
}
