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;
inline int read() {
  int x = 0, f = 1;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9')
    x = (x << 3) + (x << 1) + (c ^ '0'), c = getchar();
  return x * f;
}
const int N = 3e3 + 5;
int a[N][N << 1], r, c, n;
int dx[8] = {0, 0, 1, -1, 1, 1, -1, -1};
int dy[8] = {1, -1, 0, 0, 1, -1, 1, -1};
int f[N * N << 1];
inline int get(int x) { return x == f[x] ? x : f[x] = get(f[x]); }
inline void Union(int x, int y) {
  int fx = get(x), fy = get(y);
  f[fx] = fy;
}
inline int ya(int x, int y) { return (x - 1) * c * 2 + y; }
inline int ok(int &x, int &y) {
  if (y < 1)
    y = c << 1;
  else if (y > (c << 1))
    y = 1;
  return x >= 1 && x <= r && a[x][y];
}
inline int check(int ax, int ay) {
  int bx = ax, by = ay + c;
  for (int i = 0; i < 8; i++) {
    int Ax = ax + dx[i], Ay = ay + dy[i];
    if (!ok(Ax, Ay)) continue;
    for (int j = 0; j < 8; j++) {
      int Bx = bx + dx[j], By = by + dy[j];
      if (!ok(Bx, By)) continue;
      if (get(ya(Ax, Ay)) == get(ya(Bx, By))) return 0;
    }
  }
  return 1;
}
inline void del(int ax, int ay) {
  int bx = ax, by = ay + c;
  for (int i = 0; i < 8; i++) {
    int Ax = ax + dx[i], Ay = ay + dy[i];
    if (ok(Ax, Ay)) Union(ya(ax, ay), ya(Ax, Ay));
    int Bx = bx + dx[i], By = by + dy[i];
    if (ok(Bx, By)) Union(ya(bx, by), ya(Bx, By));
  }
  a[ax][ay] = a[bx][by] = 1;
}
inline void solve() {
  r = read(), c = read(), n = read();
  if (c == 1) return puts("0"), void();
  int ans = 0;
  for (int i = 1; i <= r; i++)
    for (int j = 1; j <= c << 1; j++) f[ya(i, j)] = ya(i, j);
  for (int i = 1; i <= n; i++) {
    int x = read(), y = read();
    if (check(x, y)) del(x, y), ans++;
  }
  printf("%d\n", ans);
}
int main() {
  solve();
  return 0;
}
