3 3 20
4 4
2 4
2 2
2 2
2 2
5 5
2 2
2 2
2 2
5 5
5 5
3 5
4 2
2 2
5 5
5 5
3 5
5 5
2 2
3 3
 1 10 10
1 19
2 12
2 8
2 16
2 2
2 4
1 9
2 18
2 14
2 10
 10 10 10
2 6
17 7
5 19
14 14
10 10
16 2
6 10
7 17
18 2
17 1
 10 10 10
12 10
8 4
10 8
15 13
11 11
8 6
9 19
13 19
6 4
19 19
 3 3 20
5 5
6 6
6 6
6 2
6 4
6 6
6 6
5 3
5 5
6 4
6 2
5 1
5 1
6 6
6 6
6 2
5 5
6 4
5 3
6 4
 3 3 20
1 1
4 4
1 1
4 4
3 3
1 1
3 1
6 6
1 1
4 6
3 1
3 3
6 4
3 1
6 6
4 6
3 1
4 6
4 6
5 1
 1 10 10
2 10
1 9
2 12
2 18
2 4
2 8
2 20
2 2
2 6
2 14
 10 10 10
2 10
4 6
1 19
7 15
20 18
3 19
11 17
9 17
16 2
19 15
 3 1 20
3 1
1 1
3 1
4 2
4 2
6 2
1 1
5 1
5 1
2 2
4 2
2 2
6 2
4 2
4 2
2 2
1 1
6 2
2 2
6 2
 10 10 10
10 12
19 7
14 12
10 10
8 6
19 19
18 2
12 2
16 4
16 2
 1 1 100
2 2
2 2
1 1
2 2
2 2
1 1
1 1
1 1
2 2
2 2
2 2
1 1
1 1
1 1
1 1
1 1
2 2
1 1
2 2
1 1
2 2
1 1
2 2
2 2
1 1
2 2
1 1
2 2
2 2
2 2
1 1
1 1
2 2
1 1
2 2
2 2
1 1
2 2
1 1
1 1
2 2
2 2
2 2
2 2
2 2
2 2
2 2
2 2
1 1
2 2
2 2
1 1
1 1
1 1
2 2
1 1
2 2
1 1
2 2
1 1
1 1
1 1
2 2
1 1
1 1
2 2
1 1
1 1
2 2
1 1
2 2
1 1
1 1
1 1
2 2
2 2
1 1
1 1
2 2
1 1
2 2
2 2
2 2
1 1
2 2
2 2
2 2
2 2
2 2
1 1
1 1
1 1
2 2
2 2
1 1
1 1
2 2
1 1
1 1
2 2
 1 10 10
1 15
1 19
2 16
1 17
2 4
2 2
2 8
1 11
2 10
2 6
 10 10 10
10 2
19 9
19 17
8 8
5 3
20 4
12 12
2 16
5 19
2 4
 2 2 20
2 4
2 4
1 3
4 2
3 3
2 4
3 3
1 3
1 3
3 3
4 4
3 1
1 3
3 3
2 2
2 4
4 2
4 2
1 1
3 1
 1 10 10
1 19
1 17
2 2
2 10
1 15
2 8
2 6
2 16
2 14
2 4
 10 10 10
8 4
2 4
9 19
16 2
13 7
11 7
7 17
6 6
1 1
15 15
 2 1 2
2 2
1 1
 1 3 100
2 2
1 1
1 5
1 1
2 4
1 1
1 1
2 2
1 1
2 2
2 2
1 1
1 5
2 6
1 1
1 1
2 4
1 3
2 6
1 5
2 6
2 2
2 6
1 1
2 4
1 5
1 1
2 6
1 5
2 4
1 3
2 6
1 5
2 6
2 4
2 2
1 3
2 6
2 4
1 3
1 1
2 2
1 3
1 1
2 6
1 5
1 5
2 4
2 4
1 3
1 5
2 4
2 6
1 3
1 1
1 3
2 6
2 2
2 2
1 1
2 2
2 6
1 5
1 3
2 6
2 4
2 2
2 2
2 6
1 3
1 5
2 2
2 4
2 2
1 3
2 2
1 5
2 4
2 6
2 2
1 5
2 6
2 6
2 6
1 3
1 5
2 2
2 2
1 1
1 5
1 3
1 3
2 2
2 4
1 5
2 2
2 6
1 3
1 3
1 3
 2 2 2
1 3
1 1
 10 10 10
17 11
11 15
8 8
2 4
7 7
9 13
12 8
18 2
15 13
13 17
 1 10 10
2 16
1 1
1 19
2 10
2 4
2 18
2 12
2 6
2 14
2 2
 1 2 100
1 3
2 2
2 4
1 3
2 4
1 1
2 2
1 1
2 4
2 2
2 2
1 3
2 4
1 3
2 4
2 2
2 2
2 4
1 3
2 2
2 4
1 1
2 4
1 3
1 1
1 1
2 4
2 2
1 1
1 3
1 1
1 1
1 1
1 1
2 2
2 4
1 1
1 3
2 4
1 1
1 1
2 4
1 3
1 1
2 4
2 4
1 1
1 1
2 4
2 4
2 4
1 1
2 4
1 3
1 3
2 2
1 1
2 2
1 1
1 3
1 1
2 2
2 4
2 4
2 2
1 3
2 2
1 1
2 4
1 1
2 4
2 4
2 4
2 2
2 2
1 3
2 2
2 2
1 1
2 4
1 1
2 2
2 2
1 1
2 2
1 3
1 3
1 3
1 1
2 4
1 3
1 3
1 1
1 1
1 1
2 4
1 3
1 1
2 4
2 2
 3 3 20
1 1
3 1
1 1
1 1
5 1
3 5
1 3
4 4
1 1
3 1
4 4
4 6
1 3
3 5
6 6
1 1
6 6
1 1
3 3
4 6
 10 10 10
7 19
14 8
15 13
6 6
10 8
18 6
3 1
16 4
8 10
12 12
 10 10 10
4 4
18 20
11 9
1 15
2 2
14 6
2 12
17 9
11 13
8 2
 3 2 10
4 2
6 4
1 3
4 2
6 4
2 2
2 4
1 3
4 4
3 1
 1 10 10
1 11
2 8
1 13
2 2
1 5
1 9
1 3
1 7
1 15
1 17
 10 10 10
15 19
12 8
7 13
12 2
8 10
3 5
13 13
9 9
18 2
5 13
 2 3 20
1 3
1 1
1 1
1 3
2 4
2 4
1 1
2 6
1 1
1 3
3 1
2 6
1 1
2 4
1 1
4 6
1 3
1 3
1 1
3 1
 3 3 20
2 6
1 5
2 6
1 1
1 1
4 6
1 5
1 1
1 1
5 1
1 3
1 3
6 2
6 2
4 6
4 4
3 1
4 4
1 1
1 3
 10 10 10
10 6
7 5
9 13
13 15
19 7
11 13
5 17
16 6
2 14
7 15
 1 1 20
1 1
2 2
2 2
2 2
1 1
2 2
1 1
2 2
1 1
1 1
1 1
1 1
1 1
2 2
1 1
2 2
1 1
1 1
2 2
1 1
 1 1 1
2 2
 1 10 10
2 4
2 8
1 19
2 2
2 10
1 5
2 6
1 17
2 14
1 15
 3 3 20
4 2
3 5
3 1
2 2
3 1
5 5
6 2
6 4
1 5
2 6
5 5
3 1
5 3
3 3
2 6
3 3
2 6
3 3
4 2
1 5
 10 10 10
1 19
3 17
12 4
16 20
5 19
5 17
20 2
15 9
16 4
4 16
 1 10 10
2 4
2 8
2 6
1 17
1 9
1 15
2 10
1 11
2 2
1 13
 10 10 10
9 17
9 13
8 10
12 2
18 14
18 6
10 6
13 19
2 12
10 8
 10 10 10
2 6
5 9
5 15
1 19
6 6
8 4
11 9
13 11
4 6
10 2
 10 10 10
16 2
12 6
8 2
12 2
3 15
6 6
7 17
4 16
11 9
2 6
 10 10 10
18 2
15 13
9 19
6 10
20 18
15 19
2 2
11 13
17 13
3 15
 1 2 1
2 2
 1 10 10
2 4
1 13
1 7
2 14
1 19
1 17
2 2
1 15
1 11
2 6
 1 10 10
1 13
2 4
1 5
2 2
1 19
1 11
1 15
1 17
1 7
2 14
 1 10 10
1 17
2 4
2 2
1 11
1 15
1 19
2 6
2 8
2 12
1 13

YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
NO
 YES
YES
YES
YES
YES
YES
NO
NO
NO
NO
 YES
YES
YES
YES
YES
YES
YES
YES
YES
NO
 YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
 YES
NO
YES
YES
YES
NO
YES
NO
NO
YES
YES
YES
YES
NO
YES
YES
YES
NO
YES
YES
 YES
NO
YES
YES
YES
YES
YES
NO
NO
NO
NO
YES
YES
NO
NO
NO
YES
YES
YES
NO
 YES
NO
NO
NO
NO
NO
NO
NO
NO
NO
 YES
YES
YES
YES
NO
NO
NO
NO
NO
NO
 YES
YES
YES
NO
YES
NO
YES
NO
YES
YES
YES
YES
YES
YES
YES
YES
NO
NO
NO
NO
 YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
 YES
YES
YES
NO
YES
YES
YES
YES
YES
YES
YES
NO
YES
NO
YES
NO
YES
YES
YES
NO
YES
YES
YES
YES
YES
NO
YES
YES
YES
YES
YES
YES
YES
NO
YES
NO
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
NO
YES
YES
YES
YES
YES
NO
YES
YES
YES
NO
YES
NO
YES
YES
YES
NO
YES
NO
YES
YES
YES
NO
YES
NO
YES
NO
YES
NO
YES
YES
YES
YES
YES
NO
YES
NO
YES
NO
YES
YES
YES
YES
YES
YES
YES
YES
YES
NO
YES
YES
 YES
YES
NO
NO
NO
NO
NO
NO
NO
NO
 YES
YES
YES
YES
NO
NO
NO
NO
NO
NO
 YES
YES
YES
YES
YES
NO
NO
YES
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
 YES
YES
YES
YES
YES
YES
YES
NO
NO
NO
 YES
YES
YES
YES
YES
YES
YES
YES
NO
NO
 YES
NO
 YES
NO
NO
YES
YES
NO
YES
YES
NO
NO
NO
YES
YES
YES
NO
YES
YES
NO
YES
YES
NO
NO
YES
NO
NO
NO
NO
NO
NO
NO
NO
YES
YES
YES
YES
YES
NO
NO
YES
YES
YES
NO
NO
YES
NO
NO
NO
NO
NO
YES
NO
NO
YES
NO
NO
NO
NO
NO
NO
NO
NO
YES
YES
NO
NO
NO
NO
NO
YES
YES
YES
YES
YES
YES
NO
NO
NO
YES
NO
NO
NO
YES
NO
YES
YES
YES
YES
YES
YES
YES
YES
YES
NO
NO
NO
NO
NO
NO
NO
NO
 YES
YES
 YES
YES
YES
YES
NO
NO
NO
NO
NO
NO
 YES
NO
NO
NO
NO
NO
NO
NO
NO
NO
 YES
YES
NO
YES
YES
NO
YES
YES
YES
YES
YES
NO
YES
YES
YES
YES
YES
YES
YES
YES
NO
NO
NO
NO
YES
NO
NO
NO
YES
NO
NO
NO
NO
NO
NO
YES
NO
NO
NO
YES
NO
NO
NO
YES
NO
YES
NO
YES
NO
YES
NO
NO
NO
NO
NO
YES
YES
YES
NO
NO
YES
YES
YES
YES
YES
YES
YES
YES
NO
NO
YES
NO
YES
YES
YES
YES
YES
YES
YES
NO
YES
YES
YES
NO
NO
NO
NO
NO
NO
YES
YES
YES
NO
YES
NO
NO
NO
YES
YES
YES
 YES
YES
YES
YES
YES
YES
YES
NO
NO
NO
YES
NO
NO
YES
NO
NO
NO
YES
NO
YES
 YES
YES
YES
YES
YES
YES
NO
NO
NO
NO
 YES
YES
NO
NO
NO
NO
NO
NO
NO
NO
 YES
YES
NO
NO
YES
YES
NO
YES
YES
NO
 YES
YES
YES
YES
NO
NO
NO
NO
NO
NO
 YES
YES
YES
YES
YES
NO
NO
NO
NO
NO
 YES
YES
YES
YES
YES
YES
YES
NO
YES
NO
NO
YES
YES
NO
NO
NO
NO
NO
NO
NO
 YES
NO
YES
YES
YES
NO
YES
NO
YES
YES
NO
YES
NO
YES
YES
YES
NO
YES
YES
YES
 YES
NO
NO
NO
NO
NO
NO
NO
NO
NO
 YES
NO
YES
NO
YES
YES
YES
NO
YES
NO
YES
NO
YES
YES
YES
NO
YES
NO
YES
YES
 YES
 YES
YES
YES
YES
YES
NO
NO
NO
NO
NO
 YES
YES
NO
NO
YES
YES
YES
YES
YES
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
NO
 YES
YES
YES
NO
NO
NO
NO
NO
NO
NO
 YES
YES
YES
YES
YES
YES
NO
NO
NO
NO
 YES
YES
YES
YES
NO
NO
NO
NO
NO
NO
 YES
YES
YES
YES
YES
YES
YES
YES
YES
YES
 YES
YES
YES
YES
YES
YES
YES
NO
NO
NO
 YES
YES
YES
YES
NO
NO
NO
NO
NO
NO
 YES
 YES
YES
YES
NO
NO
NO
NO
NO
NO
NO
 YES
YES
YES
YES
YES
YES
YES
YES
YES
NO
 YES
YES
YES
YES
YES
YES
YES
YES
NO
NO

#include <bits/stdc++.h>
using namespace std;
long long maxn;
struct tree {
  long long tx1;
  long long tx2;
  long long ty1;
  long long ty2;
  long long val;
  tree *ll;
  tree *lr;
  tree *rl;
  tree *rr;
  void pl(long long x, long long y) {
    if (x >= tx1 && x < tx2 && y >= ty1 && y < ty2) {
      ++val;
      long long tmx = (tx1 + tx2) / 2;
      long long tmy = (ty1 + ty2) / 2;
      if ((tx2 - tx1) == 1 && (ty2 - ty1) == 1) {
        return;
      }
      if (!ll) {
        ll =
            new tree{tx1, tmx, ty1, tmy, 0, nullptr, nullptr, nullptr, nullptr};
      }
      if (!lr) {
        lr =
            new tree{tx1, tmx, tmy, ty2, 0, nullptr, nullptr, nullptr, nullptr};
      }
      if (!rl) {
        rl =
            new tree{tmx, tx2, ty1, tmy, 0, nullptr, nullptr, nullptr, nullptr};
      }
      if (!rr) {
        rr =
            new tree{tmx, tx2, tmy, ty2, 0, nullptr, nullptr, nullptr, nullptr};
      }
      ll->pl(x, y);
      lr->pl(x, y);
      rl->pl(x, y);
      rr->pl(x, y);
    }
  }
  void mi(long long x, long long y) {
    if (x >= tx1 && x < tx2 && y >= ty1 && y < ty2) {
      --val;
      long long tmx = (tx1 + tx2) / 2;
      long long tmy = (ty1 + ty2) / 2;
      if ((tx2 - tx1) == 1 && (ty2 - ty1) == 1) {
        return;
      }
      if (!ll) {
        ll =
            new tree{tx1, tmx, ty1, tmy, 0, nullptr, nullptr, nullptr, nullptr};
      }
      if (!lr) {
        lr =
            new tree{tx1, tmx, tmy, ty2, 0, nullptr, nullptr, nullptr, nullptr};
      }
      if (!rl) {
        rl =
            new tree{tmx, tx2, ty1, tmy, 0, nullptr, nullptr, nullptr, nullptr};
      }
      if (!rr) {
        rr =
            new tree{tmx, tx2, tmy, ty2, 0, nullptr, nullptr, nullptr, nullptr};
      }
      ll->mi(x, y);
      lr->mi(x, y);
      rl->mi(x, y);
      rr->mi(x, y);
    }
  }
  long long cnt(long long lx, long long rx, long long ly, long long ry) {
    if (lx <= tx1 && rx >= tx2 && ly <= ty1 && ry >= ty2) {
      return val;
    }
    if (tx2 <= lx || tx1 >= rx || ty1 >= ry || ty2 <= ly) {
      return 0;
    }
    long long tmx = (tx1 + tx2) / 2;
    long long tmy = (ty1 + ty2) / 2;
    if (!ll) {
      ll = new tree{tx1, tmx, ty1, tmy, 0, nullptr, nullptr, nullptr, nullptr};
    }
    if (!lr) {
      lr = new tree{tx1, tmx, tmy, ty2, 0, nullptr, nullptr, nullptr, nullptr};
    }
    if (!rl) {
      rl = new tree{tmx, tx2, ty1, tmy, 0, nullptr, nullptr, nullptr, nullptr};
    }
    if (!rr) {
      rr = new tree{tmx, tx2, tmy, ty2, 0, nullptr, nullptr, nullptr, nullptr};
    }
    return ll->cnt(lx, rx, ly, ry) + lr->cnt(lx, rx, ly, ry) +
           rl->cnt(lx, rx, ly, ry) + rr->cnt(lx, rx, ly, ry);
  }
};
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  tree *a = new tree{0, maxn, 0, maxn, 0, nullptr, nullptr, nullptr, nullptr};
  tree *b = new tree{0, maxn, 0, maxn, 0, nullptr, nullptr, nullptr, nullptr};
  long long n, m, q;
  cin >> n >> m >> q;
  maxn = max(2 * n, 2 * m);
  long long sum = 0;
  set<pair<long long, long long> > u;
  map<pair<long long, long long>, long long> u1;
  while (q--) {
    long long x, y;
    cin >> x >> y;
    bool h = u.count({x, y});
    if (h) {
      u1[{x, y}]--;
      if (!u1[{x, y}]) {
        u.erase({x, y});
      }
    } else {
      u1[{x, y}] = 1;
      u.insert({x, y});
    }
    if (x % 2 == 0) {
      if (!h)
        a->pl(x, y);
      else
        a->mi(x, y);
    } else {
      if (!h)
        b->pl(x, y);
      else
        b->mi(x, y);
    }
    if (x % 2 == 0) {
      if (!h) {
        sum += b->cnt(0, x, 0, y);
      } else
        sum -= b->cnt(0, x, 0, y);
    } else {
      if (!h)
        sum += a->cnt(x, maxn, y, maxn);
      else
        sum -= a->cnt(x, maxn, y, maxn);
    }
    if (sum <= 0) {
      cout << "YES" << endl;
    } else {
      cout << "NO" << endl;
    }
  }
  return 0;
}
