#include <bits/stdc++.h>
using namespace std;
const int len = 2e6 + 5;
int n, m, q, com, dr[] = {0, 0, 1, -1}, dc[] = {1, -1, 0, 0};
int par[len], sz[len], mat[305][305], col[len], pre[len], out[len];
pair<int, int> pos[len];
int fin(int i) {
  if (par[i] == i) return i;
  return par[i] = fin(par[i]);
}
void join(int a, int b) {
  a = fin(a), b = fin(b);
  if (a == b) return;
  com--;
  if (sz[a] > sz[b])
    sz[a] += sz[b], par[b] = a;
  else
    sz[b] += sz[a], par[a] = b;
}
inline bool exist(int a, int b) { return (0 < a && a <= n && 0 < b && b <= m); }
inline int match(int a, int b) { return (a - 1) * m + b; }
void print() {
  printf("---------------\n");
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) printf("%d", mat[i][j]);
    printf("\n");
  }
  printf("---------------\n");
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) printf("%d", fin(match(i, j)));
    printf("\n");
  }
  printf("---------------\n");
}
void check(int x, int y) {
  for (int d = 0; d < 4; d++) {
    int a = x + dr[d], b = y + dc[d];
    if (exist(a, b) && mat[x][y] == mat[a][b]) join(match(a, b), match(x, y));
  }
}
void add(int x, int y, int c) {
  if (c == mat[x][y]) return;
  com++;
  mat[x][y] = c;
  check(x, y);
}
void init(int u) { par[u] = u, sz[u] = 1; }
int main() {
  scanf("%d %d %d", &n, &m, &q);
  for (int i = 0; i < q; i++)
    scanf("%d %d %d", &pos[i].first, &pos[i].second, &col[i]);
  for (int i = 0; i < q; i++) {
    int a = pos[i].first, b = pos[i].second;
    pre[i] = mat[a][b];
    mat[a][b] = col[i];
  }
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++) mat[i][j] = 0;
  int l = 0, r = 0;
  while (l < q) {
    while (r + 1 < q && col[r + 1] == col[l]) r++;
    com = 0;
    for (int i = l; i <= r; i++) {
      int a = pos[i].first, b = pos[i].second;
      init(match(a, b));
    }
    for (int i = l; i <= r; i++) {
      int a = pos[i].first, b = pos[i].second;
      add(a, b, col[i]);
      out[i] += com;
    }
    com = 0;
    for (int i = 1; i <= n * m; i++) par[i] = i, sz[i] = 1;
    for (int i = 1; i <= n; i++)
      for (int j = 1; j <= m; j++)
        if (mat[i][j] != col[l]) check(i, j), com++;
    for (int i = r; i >= l; i--) {
      int a = pos[i].first, b = pos[i].second;
      out[i] += com;
      add(a, b, pre[i]);
    }
    for (int i = l; i <= r; i++) {
      int a = pos[i].first, b = pos[i].second;
      mat[a][b] = col[i];
    }
    l = ++r;
  }
  for (int i = 0; i < q; i++) printf("%d\n", out[i]);
  return 0;
}
