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>
const int N = 3000 * 3000 * 2 + 9;
const int d[8][2] = {{0, 1}, {0, -1},  {1, 0},  {-1, 0},
                     {1, 1}, {-1, -1}, {1, -1}, {-1, 1}};
int n, m, K, Time[N], f[N], tmp[N], v1[10], v2[10];
bool disabled[3009][6009];
inline int getfa(int x) {
  for (; f[x] != x; x = f[x]) tmp[++tmp[0]] = x;
  for (; tmp[0]; --tmp[0]) f[tmp[tmp[0]]] = x;
  return x;
}
bool check(int x, int y, int mark) {
  if (disabled[x][y]) return false;
  v1[0] = v2[0] = 0;
  for (int i = 0; i < 8; ++i) {
    int nx = x + d[i][0], ny = y + d[i][1];
    if (ny <= 0) ny = m;
    if (ny > m) ny = 1;
    if (nx < 1 || nx > n || !disabled[nx][ny]) continue;
    int fa = getfa(((nx - 1) * m + ny));
    if (Time[fa] != mark) {
      Time[fa] = mark;
      v1[++v1[0]] = fa;
    }
  }
  y += m / 2;
  for (int i = 0; i < 8; ++i) {
    int nx = x + d[i][0], ny = y + d[i][1];
    if (ny <= 0) ny = m;
    if (ny > m) ny = 1;
    if (nx < 1 || nx > n || !disabled[nx][ny]) continue;
    int fa = getfa(((nx - 1) * m + ny));
    v2[++v2[0]] = fa;
  }
  for (int i = 1; i <= v2[0]; ++i)
    if (Time[v2[i]] == mark) return false;
  int now = ((x - 1) * m + y - m / 2);
  for (int i = 1; i <= v1[0]; ++i) f[v1[i]] = now;
  now = ((x - 1) * m + y);
  for (int i = 1; i <= v2[0]; ++i) f[v2[i]] = now;
  disabled[x][y] = disabled[x][y - m / 2] = true;
  return true;
}
void read(int &x) {
  x = 0;
  char c = getchar();
  for (; c > '9' || c < '0'; c = getchar())
    ;
  for (; c >= '0' && c <= '9'; c = getchar()) x = x * 10 + c - '0';
}
int main() {
  scanf("%d%d%d", &n, &m, &K);
  if (m == 1) return puts("0");
  m *= 2;
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= m; ++j) f[((i - 1) * m + j)] = ((i - 1) * m + j);
  int ans = 0;
  for (int i = 1, x, y; i <= K; ++i) {
    read(x);
    read(y);
    ans += check(x, y, i);
  }
  printf("%d\n", ans);
}
