#include <bits/stdc++.h>
using namespace std;
template <typename A, typename B>
string to_string(pair<A, B> p);
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);
string to_string(const string& s) { return '"' + s + '"'; }
string to_string(const char& s) {
  string res = "'";
  res += s;
  res += "'";
  return res;
}
string to_string(const bool& b) { return (b ? "true" : "false"); }
string to_string(vector<bool> v) {
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (i) res += ", ";
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}
template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto& x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
         to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " +
         to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
pair<long long, long long> inv(pair<long long, long long> a) {
  if (a.first % 2 == 1) {
    return {a.first + 1, a.second + 1};
  }
  return {a.first - 1, a.second - 1};
}
vector<bool> t;
vector<long long> a, b;
void merge(long long v, long long l, long long r) {
  t[v] = (t[v * 2 + 1] && t[v * 2 + 2]);
  if (a[v * 2 + 1] <= b[v * 2 + 2]) t[v] = 0;
  a[v] = min(a[v * 2 + 1], a[v * 2 + 2]);
  b[v] = max(b[v * 2 + 1], b[v * 2 + 2]);
}
void update(long long v, long long l, long long r, long long i, long long x,
            long long y) {
  if (l + 1 == r) {
    a[v] = x;
    b[v] = y;
    t[v] = (x > y);
    return;
  }
  long long m = (l + r) / 2;
  if (i < m)
    update(v * 2 + 1, l, m, i, x, y);
  else
    update(v * 2 + 2, m, r, i, x, y);
  merge(v, l, r);
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n, m, q;
  cin >> n >> m >> q;
  t.resize(4 * n, 1);
  a.resize(4 * n, 1e9);
  b.resize(4 * n, -1e9);
  set<long long> c[n], d[n];
  for (long long i = 0; i < n; i++) {
    c[i].insert(1e9);
    d[i].insert(-1e9);
  }
  for (long long test = 0; test < q; test++) {
    pair<long long, long long> x;
    cin >> x.first >> x.second;
    x = inv(x);
    if (x.first % 2 == 0) {
      if (c[x.first / 2 - 1].find(x.second / 2 - 1) !=
          c[x.first / 2 - 1].end()) {
        c[x.first / 2 - 1].erase(x.second / 2 - 1);
      } else {
        c[x.first / 2 - 1].insert(x.second / 2 - 1);
      }
    } else {
      if (d[x.first / 2].find(x.second / 2) != d[x.first / 2].end()) {
        d[x.first / 2].erase(x.second / 2);
      } else {
        d[x.first / 2].insert(x.second / 2);
      }
    }
    update(0, 0, n, (x.first - 1) / 2, *c[(x.first - 1) / 2].begin(),
           *d[(x.first - 1) / 2].rbegin());
    if (t[0] == 1)
      cout << "YES\n";
    else
      cout << "NO\n";
  }
}
