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;
const int R = 3010;
int n, m, fa[R * R + 2];
bool mark[R][R];
int gf(int x) {
  if (fa[x] != x) fa[x] = gf(fa[x]);
  return fa[x];
}
int id(int x, int y) { return (x - 1) * m + y; }
int main() {
  int q, s = 0, x, y, i, j, L, R;
  bool gl, gr;
  scanf("%d%d%d", &n, &m, &q);
  for (i = 1; i <= n * m + 2; i++) fa[i] = i;
  L = n * m + 1;
  R = L + 1;
  while (q--) {
    gl = gr = false;
    scanf("%d%d", &x, &y);
    if (!mark[x][y]) {
      if (y == 1) gl = true;
      if (y == m) gr = true;
      for (i = -1; i <= 1; i++)
        for (j = -1; j <= 1; j++)
          if ((x + i) >= 1 && (x + i) <= n && (y + j) >= 1 && (y + j) <= m &&
              (i || j)) {
            if (gf(id(x + i, y + j)) == gf(L)) gl = true;
            if (gf(id(x + i, y + j)) == gf(R)) gr = true;
          }
      if (gl && gr) continue;
      mark[x][y] = true;
      if (y == 1) fa[gf(id(x, y))] = gf(L);
      if (y == m) fa[gf(id(x, y))] = gf(R);
      for (i = -1; i <= 1; i++)
        for (j = -1; j <= 1; j++)
          if ((x + i) >= 1 && (x + i) <= n && (y + j) >= 1 && (y + j) <= m &&
              (i || j)) {
            fa[gf(id(x, y))] = gf(id(x + i, y + j));
          }
      s++;
    }
  }
  printf("%d\n", s);
}
