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 = 3005;
int id[N][N * 2], Vis[N][N * 2], nd;
int fa[N * N * 2], R, C, Q;
int vis[N * N * 2], ans;
int get(int x) { return x == fa[x] ? x : fa[x] = get(fa[x]); }
int main() {
  scanf("%d%d%d", &R, &C, &Q);
  if (C == 1) {
    for (int i = (int)(1); i <= (int)(Q); i++) cout << 0 << endl;
    exit(0);
  }
  for (int i = (int)(1); i <= (int)(R); i++)
    for (int j = (int)(1); j <= (int)(2 * C); j++) id[i][j] = ++nd;
  for (int i = (int)(1); i <= (int)(nd); i++) fa[i] = i;
  for (int i = (int)(1); i <= (int)(Q); i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    if (Vis[x][y]) {
      ++ans;
      continue;
    }
    for (int dx = (int)(-1); dx <= (int)(1); dx++)
      for (int dy = (int)(-1); dy <= (int)(1); dy++)
        if (dx || dy) {
          int px = x + dx, py = y + dy;
          if (px < 1 || px > R || py < 1 || py > 2 * C || !Vis[px][py])
            continue;
          vis[get(id[px][py])] = i;
        }
    bool fl = 1;
    for (int dx = (int)(-1); dx <= (int)(1); dx++)
      for (int dy = (int)(-1); dy <= (int)(1); dy++)
        if (dx || dy) {
          int px = x + dx, py = y + C + dy;
          if (px < 1 || px > R || py < 1 || py > 2 * C || !Vis[px][py])
            continue;
          if (vis[get(id[px][py])] == i) fl = 0;
        }
    if (!fl) continue;
    Vis[x][y] = Vis[x][y + C] = 1;
    ++ans;
    for (int dx = (int)(-1); dx <= (int)(1); dx++)
      for (int dy = (int)(-1); dy <= (int)(1); dy++)
        if (dx || dy) {
          int px = x + dx, py = y + dy;
          if (px < 1 || px > R || py < 1 || py > 2 * C || !Vis[px][py])
            continue;
          fa[get(id[px][py])] = get(id[x][y]);
        }
    for (int dx = (int)(-1); dx <= (int)(1); dx++)
      for (int dy = (int)(-1); dy <= (int)(1); dy++)
        if (dx || dy) {
          int px = x + dx, py = y + C + dy;
          if (px < 1 || px > R || py < 1 || py > 2 * C || !Vis[px][py])
            continue;
          fa[get(id[px][py])] = get(id[x][y + C]);
        }
  }
  cout << ans << endl;
}
