#include <bits/stdc++.h>
using namespace std;
int N, M, Q;
const int MAXN = 2e5 + 5;
set<int> odd[MAXN], even[MAXN];
struct node {
  int l, r;
  int mi, mx;
  bool flag;
} tr[MAXN << 2];
void update(int id) {
  if (tr[id].l == tr[id].r) {
    tr[id].flag = tr[id].mi > tr[id].mx;
  } else {
    if (tr[id << 1].flag && tr[id << 1 | 1].flag &&
        (tr[id << 1].mi > tr[id << 1 | 1].mx))
      tr[id].flag = true;
    else
      tr[id].flag = false;
    tr[id].mi = min(tr[id << 1].mi, tr[id << 1 | 1].mi);
    tr[id].mx = max(tr[id << 1].mx, tr[id << 1 | 1].mx);
  }
}
void update_odd(int id, int pos, int val) {
  if (tr[id].l == tr[id].r) {
    tr[id].mi = val;
    update(id);
    return;
  }
  int mid = (tr[id].l + tr[id].r) >> 1;
  if (pos <= mid)
    update_odd(id << 1, pos, val);
  else
    update_odd(id << 1 | 1, pos, val);
  update(id);
}
void update_even(int id, int pos, int val) {
  if (tr[id].l == tr[id].r) {
    tr[id].mx = val;
    update(id);
    return;
  }
  int mid = (tr[id].l + tr[id].r) >> 1;
  if (pos <= mid)
    update_even(id << 1, pos, val);
  else
    update_even(id << 1 | 1, pos, val);
  update(id);
}
void build(int id, int l, int r) {
  tr[id].l = l;
  tr[id].r = r;
  tr[id].mi = M + 1;
  tr[id].mx = 0;
  tr[id].flag = true;
  if (l == r) return;
  int mid = (l + r) >> 1;
  build(id << 1, l, mid);
  build(id << 1 | 1, mid + 1, r);
}
int main() {
  scanf("%d%d%d", &N, &M, &Q);
  for (int i = 1; i <= N; i++) {
    odd[i].insert(M + 1);
    even[i].insert(0);
  }
  build(1, 1, N);
  int x, y;
  while (Q--) {
    scanf("%d%d", &x, &y);
    if (x & 1) {
      x = (x + 1) / 2;
      y = (y + 1) / 2;
      if (odd[x].find(y) != odd[x].end())
        odd[x].erase(y);
      else
        odd[x].insert(y);
      update_odd(1, x, *odd[x].begin());
    } else {
      x /= 2;
      y /= 2;
      if (even[x].find(y) != even[x].end())
        even[x].erase(y);
      else
        even[x].insert(y);
      update_even(1, x, *--even[x].end());
    }
    if (tr[1].flag)
      puts("YES");
    else
      puts("NO");
  }
  return 0;
}
