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;
const int maxn = 200010;
map<pair<int, int>, int> mp;
int n, m, q, ans[maxn];
vector<pair<int, int> > add[maxn << 2];
void upd(int L, int R, pair<int, int> x, int l, int r, int rt) {
  if (L <= l && r <= R) {
    add[rt].push_back(x);
    return;
  }
  int m = (l + r) >> 1;
  if (L <= m) upd(L, R, x, l, m, rt << 1);
  if (R > m) upd(L, R, x, m + 1, r, rt << 1 | 1);
}
struct segTree {
  int mx[maxn * 8];
  vector<int> vp, vx;
  void upd(int p, int v, int l, int r, int rt) {
    if (v > mx[rt]) {
      vp.push_back(rt), vx.push_back(mx[rt]);
      mx[rt] = v;
    }
    if (l == r) return;
    int m = (l + r) >> 1;
    if (p <= m)
      upd(p, v, l, m, rt << 1);
    else
      upd(p, v, m + 1, r, rt << 1 | 1);
  }
  void rollback(int s) {
    while (vp.size() > s) {
      mx[vp[vp.size() - 1]] = vx[vx.size() - 1];
      vp.pop_back(), vx.pop_back();
    }
  }
  int ask(int L, int R, int l, int r, int rt) {
    if (L <= l && r <= R) return mx[rt];
    int m = (l + r) >> 1, ret = 0;
    if (L <= m) ret = max(ret, ask(L, R, l, m, rt << 1));
    if (R > m) ret = max(ret, ask(L, R, m + 1, r, rt << 1 | 1));
    return ret;
  }
} T1, T2;
void dfs(int l, int r, int rt, int ok) {
  int s1 = T1.vp.size(), s2 = T2.vp.size();
  for (int i = 0; i < add[rt].size(); i++) {
    int x = add[rt][i].first, y = add[rt][i].second;
    if (x & 1) {
      int r = T2.ask(x, 2 * n, 1, 2 * n, 1);
      if (r >= y) ok = 0;
      T1.upd(x, 2 * m - y + 1, 1, 2 * n, 1);
    } else {
      int r = 2 * m - T1.ask(1, x, 1, 2 * n, 1) + 1;
      if (r <= y) ok = 0;
      T2.upd(x, y, 1, 2 * n, 1);
    }
  }
  if (l == r) {
    ans[l] = ok;
  } else {
    int m = (l + r) >> 1;
    dfs(l, m, rt << 1, ok);
    dfs(m + 1, r, rt << 1 | 1, ok);
  }
  T1.rollback(s1), T2.rollback(s2);
}
int main() {
  scanf("%d%d%d", &n, &m, &q);
  for (int i = 1; i <= q; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    if (mp.find(pair<int, int>(x, y)) != mp.end()) {
      upd(mp[pair<int, int>(x, y)], i - 1, pair<int, int>(x, y), 1, q, 1);
      mp.erase(pair<int, int>(x, y));
    } else
      mp[pair<int, int>(x, y)] = i;
  }
  for (map<pair<int, int>, int>::iterator iter = mp.begin(); iter != mp.end();
       ++iter) {
    upd(iter->second, q, iter->first, 1, q, 1);
  }
  dfs(1, q, 1, 1);
  for (int i = 1; i <= q; i++) {
    if (ans[i])
      puts("YES");
    else
      puts("NO");
  }
  return 0;
}
