#include <bits/stdc++.h>
using namespace std;
const int inf = 309, Q = 2e6 + 9;
int n, m, q, colors, a[inf][inf], change[Q], par[inf * inf];
int idx[] = {0, 0, -1, 1};
int idy[] = {1, -1, 0, 0};
struct Query {
  int x, y, idx;
};
vector<Query> del[Q], add[Q];
bool valid(int x, int y) { return x >= 1 && y >= 1 && y <= m && x <= n; }
int root(int x) { return (par[x] == x ? x : par[x] = root(par[x])); }
bool join(int x, int y) {
  x = root(x), y = root(y);
  if (x == y) return 0;
  if (rand() % 2) swap(x, y);
  par[x] = y;
  return 1;
}
int encode(int x, int y) { return x * m + y; }
void process(vector<Query> &events, int sign) {
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++) a[i][j] = 0, par[encode(i, j)] = encode(i, j);
  for (auto o : events) {
    int Cnt = 1, i = o.x, j = o.y;
    a[i][j] = 1;
    for (int z = 0; z < 4; z++) {
      int x = i + idx[z], y = j + idy[z];
      if (valid(x, y) && a[x][y] == 1) Cnt -= join(encode(i, j), encode(x, y));
    }
    change[o.idx] += Cnt * sign;
  }
}
int main() {
  scanf("%d%d%d", &n, &m, &q);
  for (int i = 1; i <= q; i++) {
    int x, y, c;
    scanf("%d%d%d", &x, &y, &c);
    Query cur = {x, y, i};
    del[a[x][y]].push_back(cur);
    add[c].push_back(cur);
    a[x][y] = c;
    colors = c;
  }
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++) del[a[i][j]].push_back({i, j, q + 1});
  for (int i = 0; i <= colors; i++) reverse(del[i].begin(), del[i].end());
  for (int i = 0; i <= colors; i++) process(add[i], 1);
  for (int i = 0; i <= colors; i++) process(del[i], -1);
  int ans = 1;
  for (int i = 1; i <= q; i++) {
    ans += change[i];
    printf("%d\n", ans);
  }
}
