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 inf = 0x20202020;
const int mod = 1000000007;
template <class T>
inline void read(T& x) {
  bool fu = 0;
  char c;
  for (c = getchar(); c <= 32; c = getchar())
    ;
  if (c == '-') fu = 1, c = getchar();
  for (x = 0; c > 32; c = getchar()) x = x * 10 + c - '0';
  if (fu) x = -x;
};
template <class T>
inline void read(T& x, T& y) {
  read(x);
  read(y);
}
template <class T>
inline void read(T& x, T& y, T& z) {
  read(x);
  read(y);
  read(z);
}
template <class T>
inline void read(T& x, T& y, T& z, T& q) {
  read(x);
  read(y);
  read(z);
  read(q);
}
const int DX[] = {1, 0, -1, 0, -1, -1, 1, 1, 0},
          DY[] = {0, 1, 0, -1, -1, 1, -1, 1, 0};
long long powmod(long long a, long long b) {
  long long res = 1;
  a %= mod;
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
long long powmod(long long a, long long b, long long mod) {
  long long res = 1;
  a %= mod;
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
const int N = 18999999, M = 3333;
int l, m, n, t, C, f[N], x, y, vis[M][2 * M], nn;
int getf(int x) {
  if (x == f[x]) return x;
  return f[x] = getf(f[x]);
}
void modi(int x, int y) {
  for (int _tmp = 7, k = 0; k <= _tmp; ++k)
    if (vis[x + DX[k]][(y + n + DY[k] - 1) % n])
      f[getf(((x + DX[k]) * (n + 2) + (y + DY[k] + n - 1) % n))] =
          getf(((x) * (n + 2) + (y + n - 1) % n));
  vis[x][(y + n - 1) % n] = 1;
}
int main() {
  scanf("%d%d%d", &m, &n, &C);
  nn = n;
  n *= 2;
  if (nn == 1) {
    puts("0");
    return 0;
  }
  for (int _tmp = m + 1, i = 0; i <= _tmp; ++i)
    for (int _tmp = n + 1, j = 0; j <= _tmp; ++j)
      f[((i) * (n + 2) + (j + n - 1) % n)] = ((i) * (n + 2) + (j + n - 1) % n);
  int ans = 0;
  for (int _tmp = C, _ = 1; _ <= _tmp; ++_) {
    scanf("%d%d", &x, &y);
    int bo = 0;
    for (int _tmp = 7, u = 0; u <= _tmp; ++u)
      for (int _tmp = 7, v = 0; v <= _tmp; ++v)
        if (vis[x + DX[u]][(y + DY[u] + n - 1) % n] &&
            vis[x + DX[v]][(y + DY[v] + nn + n - 1) % n] &&
            getf(((x + DX[u]) * (n + 2) + (y + DY[u] + n - 1) % n)) ==
                getf(((x + DX[v]) * (n + 2) + (y + DY[v] + nn + n - 1) % n)))
          bo = 1;
    if (bo) continue;
    modi(x, y);
    modi(x, y + nn);
    ++ans;
  }
  printf("%d\n", ans);
  return 0;
}
