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>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
struct node {
  node *l, *r;
  int a, b;
  int ok;
  int Max, Min;
  node(int _a, int _b)
      : a(_a), b(_b), l(NULL), r(NULL), Min(1e9), Max(0), ok(1) {}
} * root;
void pull(node *n) {
  n->ok = n->l->ok && n->r->ok && (n->l->Min > n->r->Max);
  n->Max = max(n->l->Max, n->r->Max);
  n->Min = min(n->l->Min, n->r->Min);
}
void build(node *n) {
  if (n->a == n->b) {
    return;
  }
  int mid = (n->a + n->b) / 2;
  n->l = new node(n->a, mid);
  n->r = new node(mid + 1, n->b);
  build(n->l);
  build(n->r);
}
void reviseMax(node *n, int first, int k) {
  if (n->a == n->b) {
    n->Max = k;
    if (n->Max < n->Min)
      n->ok = 1;
    else
      n->ok = 0;
    return;
  }
  int mid = (n->a + n->b) / 2;
  if (first <= mid)
    reviseMax(n->l, first, k);
  else
    reviseMax(n->r, first, k);
  pull(n);
}
void reviseMin(node *n, int first, int k) {
  if (n->a == n->b) {
    n->Min = k;
    if (n->Max < n->Min)
      n->ok = 1;
    else
      n->ok = 0;
    return;
  }
  int mid = (n->a + n->b) / 2;
  if (first <= mid)
    reviseMin(n->l, first, k);
  else
    reviseMin(n->r, first, k);
  pull(n);
}
set<int> s[400005];
void solve() {
  int n, m, q;
  scanf("%d %d %d", &n, &m, &q);
  for (int i = 2; i <= 2 * n + 1; i++) {
    if (i % 2)
      s[i].insert(0);
    else
      s[i].insert(1e9);
  }
  root = new node(1, n);
  build(root);
  while (q--) {
    int first, second;
    scanf("%d %d", &first, &second);
    first++;
    second++;
    if (s[first].find(second) == s[first].end()) {
      s[first].insert(second);
    } else {
      s[first].erase(second);
    }
    if (first % 2 == 0) {
      second = *s[first].begin();
      first /= 2;
      second /= 2;
      reviseMin(root, first, second);
    } else {
      second = *s[first].rbegin();
      first /= 2;
      second /= 2;
      reviseMax(root, first, second);
    }
    if (root->ok)
      printf("YES\n");
    else
      printf("NO\n");
  }
}
int main() {
  int t = 1;
  while (t--) {
    solve();
  }
}
