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 N = 20000000;
bool vis[3004][6004];
bool temp[N];
int f[N], p[3004][6004];
int n, row, column;
int dx[] = {0, 0, 1, 1, 1, -1, -1, -1}, dy[] = {1, -1, 0, -1, 1, 0, -1, 1};
int find(int u) {
  if (u == f[u])
    return u;
  else
    return f[u] = find(f[u]);
}
bool check(int x, int y) {
  for (int i = 0; i < 8; i++) {
    int nx = x + dx[i];
    int ny = y + dy[i];
    if (nx < 0 || nx >= row) continue;
    ny = (ny + 2 * column) % (2 * column);
    if (!vis[nx][ny]) continue;
    if (temp[find(p[nx][ny])]) return false;
  }
  return true;
}
void test(int a, int b) {
  int fb = find(b);
  temp[fb] = 1;
}
void merge(int a, int b) {
  int fb = find(b);
  temp[fb] = 0;
  f[fb] = a;
}
int main() {
  scanf("%d%d%d", &row, &column, &n);
  for (int i = 0; i < row; i++)
    for (int j = 0; j < 2 * column; j++) {
      p[i][j] = i * 2 * column + j;
      f[p[i][j]] = p[i][j];
    }
  int ans = 0, cnt = 0;
  while (n--) {
    cnt++;
    int x, y;
    scanf("%d%d", &x, &y);
    x--;
    y--;
    if (vis[x][y]) continue;
    vis[x][y] = 1;
    temp[p[x][y]] = 1;
    for (int i = 0; i < 8; i++) {
      int nx = x + dx[i];
      int ny = y + dy[i];
      if (nx < 0 || nx >= row) continue;
      ny = (ny + 2 * column) % (2 * column);
      if (!vis[nx][ny]) continue;
      test(p[x][y], p[nx][ny]);
    }
    if (check(x, y + column)) {
      ans++;
      for (int i = 0; i < 8; i++) {
        int nx = x + dx[i];
        int ny = y + dy[i];
        if (nx < 0 || nx >= row) continue;
        ny = (ny + 2 * column) % (2 * column);
        if (!vis[nx][ny]) continue;
        merge(p[x][y], p[nx][ny]);
      }
      vis[x][y + column] = 1;
      for (int i = 0; i < 8; i++) {
        int nx = x + dx[i];
        int ny = y + column + dy[i];
        if (nx < 0 || nx >= row) continue;
        ny = (ny + 2 * column) % (2 * column);
        if (!vis[nx][ny]) continue;
        merge(p[x][y + column], p[nx][ny]);
      }
    } else {
      for (int i = 0; i < 8; i++) {
        int nx = x + dx[i];
        int ny = y + dy[i];
        if (nx < 0 || nx >= row) continue;
        ny = (ny + 2 * column) % (2 * column);
        if (!vis[nx][ny]) continue;
        temp[find(p[nx][ny])] = 0;
      }
      vis[x][y] = 0;
    }
    temp[p[x][y]] = 0;
  }
  printf("%d\n", ans);
  return 0;
}
