#include <bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
  cerr << '{';
  __print(x.first);
  cerr << ',';
  __print(x.second);
  cerr << '}';
}
template <typename T>
void __print(const T &x) {
  int first = 0;
  cerr << '{';
  for (auto &i : x) cerr << (first++ ? "," : ""), __print(i);
  cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
  __print(t);
  if (sizeof...(v)) cerr << ", ";
  _print(v...);
}
const long long INF = 9e18;
long long mod = 1000000007;
inline long long fast_expo(long long base, long long power,
                           long long modulo = mod) {
  base %= modulo;
  if (base < 0) base += modulo;
  long long x = base, cnt = power, ans = 1;
  while (cnt) {
    if (cnt & 1) ans = (ans * x) % modulo;
    x = (x * x) % modulo;
    cnt >>= 1;
  }
  return ans;
}
long long takemod(long long a, long long mo) {
  a %= mo;
  if (a < 0) a += mo;
  return a;
}
long long modinv(long long a, long long mo) {
  return takemod(fast_expo(takemod(a, mo), mo - 2, mo), mo);
}
const int nax = 4e5 + 5;
set<int> typea[nax];
set<int> typeb[nax];
struct Segtree {
  int siz;
  vector<long long> rowa;
  vector<long long> rowb;
  vector<long long> isbad;
  vector<long long> lo;
  vector<long long> hi;
  Segtree(int n) {
    siz = 4 * n;
    rowa.resize(siz + 1);
    rowb.resize(siz + 1);
    isbad.resize(siz + 1);
    lo.resize(siz + 1);
    hi.resize(siz + 1);
    build(1, n, 1);
  }
  void build(long long l, long long r, long long idx) {
    lo[idx] = l, hi[idx] = r;
    if (l == r) {
      rowa[idx] = INF;
      rowb[idx] = 0;
      isbad[idx] = 0;
      return;
    }
    long long mid = (l + r) / 2;
    build(l, mid, 2 * idx);
    build(mid + 1, r, 2 * idx + 1);
    merge(idx);
  }
  void update(long long idx, long long pos, long long val) {
    if (hi[idx] < pos || lo[idx] > pos) {
      return;
    }
    if (lo[idx] == hi[idx]) {
      if ((int)typea[pos].size())
        rowa[idx] = *typea[pos].begin();
      else
        rowa[idx] = INF;
      if ((int)typeb[pos].size())
        rowb[idx] = *typeb[pos].rbegin();
      else
        rowb[idx] = 0;
      isbad[idx] = rowb[idx] >= rowa[idx];
      return;
    }
    update(2 * idx, pos, val);
    update(2 * idx + 1, pos, val);
    merge(idx);
  }
  long long query(long long idx, long long l, long long r) {
    if (hi[idx] < l || lo[idx] > r) {
      return 0;
    }
    if (l <= lo[idx] && hi[idx] <= r) {
      return isbad[idx];
    }
    long long Left = query(2 * idx, l, r);
    long long Right = query(2 * idx + 1, l, r);
    return Left | Right;
  }
  void merge(long long idx) {
    isbad[idx] = isbad[2 * idx] | isbad[2 * idx + 1];
    rowb[idx] = max(rowb[2 * idx], rowb[2 * idx + 1]);
    rowa[idx] = min(rowa[2 * idx], rowa[2 * idx + 1]);
    isbad[idx] |= rowb[2 * idx + 1] >= rowa[2 * idx];
  }
};
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long n, m, q;
  cin >> n >> m >> q;
  Segtree segtree(n);
  while (q--) {
    long long x, y;
    cin >> x >> y;
    if (x & 1) {
      if (typea[(x + 1) / 2].count(y)) {
        typea[(x + 1) / 2].erase(y);
        segtree.update(1, (x + 1) / 2, 314159265358979);
      } else {
        typea[(x + 1) / 2].insert(y);
        segtree.update(1, (x + 1) / 2, 314159265358979);
      }
    } else {
      if (typeb[x / 2].count(y)) {
        typeb[x / 2].erase(y);
        segtree.update(1, x / 2, 314159265358979);
      } else {
        typeb[x / 2].insert(y);
        segtree.update(1, x / 2, 314159265358979);
      }
    }
    cout << (segtree.query(1, 1, 2 * n) ? "NO" : "YES") << "\n";
  }
  return 0;
}
