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 MAXN = 1006;
const int dx[] = {0, 0, 1, 1, 1, -1, -1, -1};
const int dy[] = {1, -1, 0, -1, 1, 0, -1, 1};
int n, m, q;
int G[MAXN][MAXN];
int fa[MAXN * MAXN], idx[MAXN][MAXN], fk[MAXN * MAXN], siz[MAXN * MAXN];
int find(int x) { return x == fa[x] ? x : fa[x] = find(fa[x]); }
int fd(int x) { return x == fa[x] ? x : fd(fa[x]); }
int gid(int x, int y) { return (x - 1) * (2 * m) + y; }
void solve() {
  cin >> n >> m >> q;
  for (int i = (1), iend = (n); i <= iend; ++i)
    for (int j = (1), jend = (m * 2); j <= jend; ++j)
      idx[i][j] = gid(i, j), fa[idx[i][j]] = idx[i][j];
  for (int i = (1), iend = (n); i <= iend; ++i)
    fk[idx[i][1]] = 1, fk[idx[i][m]] = 2;
  static int g[10];
  int as = 0;
  for (int i = (1), iend = (q); i <= iend; ++i) {
    int x, y;
    scanf("%d%d", &x, &y);
    for (int d = 0; d < 8; ++d) {
      int tx = x + dx[d], ty = y + dy[d];
      g[d] = 0;
      if (!tx || tx > n || !ty || ty > m * 2) continue;
      if (G[tx][ty]) {
        g[d] = find(G[tx][ty]);
        fa[g[d]] = idx[x][y];
      }
    }
    for (int d = (0), dend = (7); d <= dend; ++d) {
      int tx = x + dx[d], ty = y + dy[d] + m;
      g[d + 8] = 0;
      if (!tx || tx > n || !ty || ty > m * 2) continue;
      if (G[tx][ty]) {
        g[d + 8] = find(G[tx][ty]);
        fa[g[d + 8]] = idx[x][y + m];
      }
    }
    if (fd(idx[x][y + m] == fd(idx[x][y]))) {
      for (int d = (0), dend = (15); d <= dend; ++d)
        if (g[d]) fa[g[d]] = g[d];
    } else
      ++as, G[x][y] = idx[x][y], G[x][y + m] = idx[x][y + m];
  }
  cout << as << endl;
  for (int i = (1), iend = (n); i <= iend; ++i)
    for (int j = (1), jend = (m); j <= jend; ++j)
      fk[idx[i][j]] = fa[idx[i][j]] = G[i][j] = 0, idx[i][j] = 0;
}
signed main() {}
