#include <bits/stdc++.h>
using namespace std;
pair<int, pair<int, int> > operator+(pair<int, pair<int, int> > a,
                                     pair<int, pair<int, int> > b) {
  return {a.first || b.first || (a.second.first < b.second.second),
          {min(a.second.first, b.second.first),
           max(a.second.second, b.second.second)}};
}
const int mxn = 1 << 19;
int n, m, q;
set<int> second[mxn];
pair<int, pair<int, int> > T[mxn << 1];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m >> q;
  for (int i = 0; i < (mxn << 1); i++) {
    if (i < mxn) second[i].insert(!(i & 1) * mxn - 1);
    T[i].second.first = mxn - 1;
  }
  while (q--) {
    int x, y;
    cin >> x >> y;
    x--, y--;
    if (!second[x].count(y))
      second[x].insert(y);
    else
      second[x].erase(y);
    if (!(x & 1))
      T[x + mxn].second.first = *second[x].begin();
    else
      T[x + mxn].second.second = *prev(second[x].end());
    for (int i = (x + mxn) >> 1; i; i >>= 1) T[i] = T[i << 1] + T[i << 1 | 1];
    cout << (T[1].first ? "NO" : "YES") << '\n';
  }
  return 0;
}
