#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const ll MOD = 998244353;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
ll binpow(ll a, ll b) {
  ll res = 1;
  while (b) {
    if (b & 1) res = (res * a) % MOD;
    a = (a * a) % MOD;
    b >>= 1;
  }
  return res;
}
ll modInv(ll a) { return binpow(a, MOD - 2); }
const double PI = acos(-1);
const int INF = 0x3f3f3f3f;
const int NINF = 0xc0c0c0c0;
const ll INFLL = 0x3f3f3f3f3f3f3f3f;
const ll NINFLL = 0xc0c0c0c0c0c0c0c0;
const int mxN = 200001;
int n, m, q;
struct node {
  int o, e;
  bool ok;
  node() : o(INF), e(-1), ok(false) {}
} seg[2 * mxN];
node merge(node a, node b) {
  node res;
  res.o = min(a.o, b.o);
  res.e = max(a.e, b.e);
  res.ok = ((a.o <= b.e) || a.ok || b.ok);
  return res;
}
void upd(int p, node a) {
  for (seg[p += n] = a; p > 1; p >>= 1) {
    if (p & 1)
      seg[p >> 1] = merge(seg[p ^ 1], seg[p]);
    else
      seg[p >> 1] = merge(seg[p], seg[p ^ 1]);
  }
}
node query(int l, int r) {
  r++;
  node left, right;
  for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
    if (l & 1) left = merge(left, seg[l++]);
    if (r & 1) right = merge(seg[--r], right);
  }
  return merge(left, right);
}
set<int> odd[mxN];
set<int> even[mxN];
int main() {
  mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
  cin.tie(0)->sync_with_stdio(0);
  cin >> n >> m >> q;
  for (int i = (0); i < (n); ++i) {
    odd[i].insert(INF);
    even[i].insert(-1);
  }
  int a, b;
  while (q--) {
    cin >> a >> b;
    a--;
    if (a & 1) {
      if (even[a / 2].count(b)) {
        even[a / 2].erase(even[a / 2].find(b));
      } else
        even[a / 2].insert(b);
    } else {
      if (odd[a / 2].count(b)) {
        odd[a / 2].erase(odd[a / 2].find(b));
      } else
        odd[a / 2].insert(b);
    }
    int k = *odd[a / 2].begin();
    int j = *even[a / 2].rbegin();
    node nxt;
    nxt.o = k;
    nxt.e = j;
    nxt.ok = (k <= j);
    upd(a / 2, nxt);
    if (query(0, n - 1).ok) {
      cout << "NO\n";
    } else {
      cout << "YES\n";
    }
  }
  return 0;
}
