#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
const int NN = 4040040;
const int MM = 303;
int n, m, q;
int a[MM][MM];
int root[MM * MM];
int ans[NN];
int sz[MM * MM];
vector<pii> add[NN], del[NN];
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
bool in(int first, int second) {
  return 1 <= first && first <= n && 1 <= second && second <= m;
}
int find_root(int u) { return root[u] == u ? u : root[u] = find_root(root[u]); }
int merge(int a, int b) {
  int aa = find_root(a);
  int bb = find_root(b);
  if (aa == bb) return 0;
  if (sz[aa] > sz[bb]) swap(aa, bb);
  sz[bb] += sz[aa];
  root[aa] = bb;
  return 1;
}
void update(vector<pii> vec, int val) {
  for (int i = 0; i <= n; i++)
    for (int j = 0; j <= m; j++) a[i][j] = 0;
  for (int i = 0; i <= n * m; i++) root[i] = i, sz[i] = 1;
  for (auto p : vec) {
    int res = 1;
    int first = p.first / m + 1;
    int second = p.first % m + 1;
    a[first][second] = 1;
    for (int i = 0; i < 4; i++) {
      int xx = first + dx[i];
      int yy = second + dy[i];
      if (in(xx, yy) && a[xx][yy] == 1)
        res -= merge((xx - 1) * m + yy - 1, (first - 1) * m + second - 1);
    }
    ans[p.second] += res * val;
  }
}
int main() {
  cin >> n >> m >> q;
  int mx = 1;
  for (int i = 1; i <= q; i++) {
    int first, second, c;
    scanf("%d %d %d", &first, &second, &c);
    if (a[first][second] == c) continue;
    mx = c;
    add[c].push_back(pii((first - 1) * m + second - 1, i));
    del[a[first][second]].push_back(pii((first - 1) * m + second - 1, i));
    a[first][second] = c;
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= m; j++) {
      del[a[i][j]].push_back(pii((i - 1) * m + j - 1, q + 1));
    }
  }
  for (int i = 0; i <= mx; i++) reverse(del[i].begin(), del[i].end());
  for (int i = 0; i <= mx; i++) update(add[i], 1);
  for (int i = 0; i <= mx; i++) update(del[i], -1);
  int res = 1;
  for (int i = 1; i <= q; i++) {
    res += ans[i];
    printf("%d\n", res);
  }
}
