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;
int R, C, K, Ans, tot;
int go[8][2] = {{0, 1}, {0, -1}, {1, 1},   {1, -1},
                {1, 0}, {-1, 0}, {-1, -1}, {-1, 1}};
int id[3050][3050 * 2], fa[3050 * 3050 * 2];
inline int read() {
  int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch <= '9' && ch >= '0') {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  return x * f;
}
int Find(int x) { return (fa[x] == x) ? x : (fa[x] = Find(fa[x])); }
int main() {
  R = read();
  C = read();
  K = read();
  while (K--) {
    int x = read(), y = read();
    if (C == 1) continue;
    bool Get = false;
    for (int i = 0; i < 8; i++) {
      int x1 = x + go[i][0], y1 = y + go[i][1];
      if (y1 == 0) y1 = 2 * C;
      if (!id[x1][y1]) continue;
      for (int j = 0; j < 8; j++) {
        int x2 = x + go[j][0], y2 = C + y + go[j][1];
        if (y2 > 2 * C) y2 -= 2 * C;
        if (id[x2][y2] && Find(id[x1][y1]) == Find(id[x2][y2])) Get = true;
      }
    }
    if (!Get) {
      Ans++;
      id[x][y] = ++tot;
      fa[tot] = tot;
      id[x][y + C] = ++tot;
      fa[tot] = tot;
      for (int i = 0; i < 8; i++) {
        int x1 = x + go[i][0], y1 = y + go[i][1], y2 = y + go[i][1] + C;
        if (y1 == 0) y1 = 2 * C;
        if (y2 > 2 * C) y2 = 1;
        cout << x1 << " " << y1 << " " << y2 << endl;
        if (id[x1][y1]) fa[Find(id[x1][y1])] = tot - 1;
        if (id[x1][y2]) fa[Find(id[x1][y2])] = tot;
      }
    }
  }
  cout << Ans << endl;
  return 0;
}
