2 5 10
2 2
1 1
1 4
2 1
1 2
1 5
2 4
2 5
1 3
2 3
 2 2 2
1 1
2 2
 3 3 9
1 1
1 2
1 3
2 1
2 2
2 3
3 1
3 2
3 3
 7 5 35
5 3
3 5
1 1
2 5
6 4
7 2
5 1
3 4
6 5
7 3
4 1
2 2
4 2
2 4
4 3
3 3
6 1
1 2
4 5
1 3
2 1
5 5
7 5
7 1
6 2
1 4
1 5
3 2
4 4
5 2
2 3
6 3
7 4
5 4
3 1
 1 5 4
1 1
1 2
1 4
1 5
 1 1 1
1 1
 5 7 21
4 4
4 5
5 5
5 6
5 7
5 1
5 2
4 2
3 2
3 1
3 7
3 6
2 6
1 6
1 7
1 1
1 2
1 3
1 4
2 4
3 4
 2 1 1
1 1
 2 2 4
2 1
1 1
1 2
2 2
 3000 3000 1
2222 738
 5 7 35
1 2
2 3
5 1
5 7
4 4
5 3
3 1
2 6
4 5
2 7
4 1
2 1
2 2
1 7
5 6
3 6
4 6
1 6
1 1
3 3
3 4
4 2
2 5
5 5
3 5
2 4
1 5
1 3
4 3
5 4
1 4
3 7
4 7
3 2
5 2
 5 4 1
4 1
 3 4 12
2 3
3 2
2 2
2 1
1 2
3 1
1 4
1 3
3 3
2 4
3 4
1 1
 3 3 3
1 1
2 2
3 3

8
 1
 6
 26
 4
 0
 20
 0
 2
 1
 28
 1
 9
 3

#include <bits/stdc++.h>
using namespace std;
bool M[3000][6000];
int dr[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int dc[] = {-1, 0, 1, -1, 1, -1, 0, 1};
int parent[18000000];
int Find(int x) {
  if (parent[x] != x) parent[x] = Find(parent[x]);
  return parent[x];
}
void Union(int x, int y) {
  x = Find(x);
  y = Find(y);
  parent[x] = y;
}
int R, C;
int id(int r, int c) { return r * 2 * C + c; }
int main() {
  int N, r, c;
  scanf("%d %d %d", &R, &C, &N);
  if (C == 1) {
    for (int i = 0; i < N; ++i) printf("0\n");
  } else {
    for (int i = R * 2 * C - 1; i >= 0; --i) parent[i] = i;
    int ans = 0;
    while (N--) {
      scanf("%d %d", &r, &c);
      --r;
      --c;
      bool add = true;
      for (int k1 = 0; k1 < 8; ++k1) {
        int r2 = r + dr[k1], c2 = c + dc[k1];
        if (c2 == -1) c2 = 2 * C - 1;
        if (c2 == 2 * C) c2 = 0;
        if (r2 >= 0 && r2 < R && M[r2][c2]) {
          int u = id(r2, c2);
          for (int k2 = 0; k2 < 8; ++k2) {
            int r3 = r + dr[k2], c3 = c + C + dc[k2];
            if (c3 == -1) c3 = 2 * C - 1;
            if (c3 == 2 * C) c3 = 0;
            if (r3 >= 0 && r3 < R && M[r3][c3]) {
              int v = id(r3, c3);
              if (Find(u) == Find(v)) add = false;
            }
          }
        }
      }
      if (add) {
        ++ans;
        M[r][c] = M[r][c + C] = true;
        for (int k = 0; k < 8; ++k) {
          int r2 = r + dr[k], c2 = c + dc[k];
          if (c2 == -1) c2 = 2 * C - 1;
          if (c2 == 2 * C) c2 = 0;
          if (r2 >= 0 && r2 < R && M[r2][c2]) Union(id(r, c), id(r2, c2));
        }
        for (int k = 0; k < 8; ++k) {
          int r2 = r + dr[k], c2 = c + C + dc[k];
          if (c2 == -1) c2 = 2 * C - 1;
          if (c2 == 2 * C) c2 = 0;
          if (r2 >= 0 && r2 < R && M[r2][c2]) Union(id(r, c + C), id(r2, c2));
        }
      }
    }
    printf("%d\n", ans);
  }
  return 0;
}
