#include <bits/stdc++.h>
using namespace std;
const int N = 200000, M = 200000, K = 9;
int oo[N], oi[N], *oho[N], *ohi[N];
int ww[M], aa[M], bb[M];
bool bad[K][K][K][K];
int aa_[K];
int dd[K][K];
int cnt;
void init(int n) {
  for (int i = 0; i < n; i++) {
    oho[i] = (int *)malloc(2 * sizeof *oho[i]);
    ohi[i] = (int *)malloc(2 * sizeof *ohi[i]);
  }
}
void link(int *oo, int **oh, int i, int h) {
  int &o = oo[i];
  if (o >= 2 && (o & o - 1) == 0)
    oh[i] = (int *)realloc(oh[i], (o << 1) * sizeof *oh[i]);
  oh[i][o++] = h;
}
void count(int k, int b) {
  if (b == k) {
    cnt++;
    return;
  }
  for (int a = 0; a <= b; a++) {
    if (bad[b][a][b][a]) continue;
    for (int b_ = 0; b_ < b; b_++) {
      int a_ = aa_[b_];
      if (bad[b_][a_][b][a]) goto end;
    }
    aa_[b] = a;
    count(k, b + 1);
  end:;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n, m, k;
  cin >> n >> m >> k;
  init(n);
  for (int h = 0; h < m; h++) {
    int i, j, w;
    cin >> i >> j >> w, i--, j--;
    ww[h] = w;
    link(oo, oho, i, h);
    link(oi, ohi, j, h);
  }
  for (int i = 0; i < n; i++) {
    sort(oho[i], oho[i] + oo[i],
         [](int h1, int h2) { return ww[h1] < ww[h2]; });
    for (int o = 0; o < oo[i]; o++) {
      int h = oho[i][o];
      aa[h] = o;
      bb[h] = oo[i] - 1;
    }
  }
  for (int i = 0; i < n; i++) {
    for (int b = 0; b < k; b++)
      for (int a = 0; a <= b; a++) dd[b][a] = 0;
    for (int o = 0; o < oi[i]; o++) {
      int h = ohi[i][o], a = aa[h], b = bb[h];
      dd[b][a]++;
    }
    for (int b1 = 0; b1 < k; b1++)
      for (int a1 = 0; a1 <= b1; a1++) {
        if (dd[b1][a1] != 1) {
          if (dd[b1][a1] > 1) bad[b1][a1][b1][a1] = true;
          continue;
        }
        for (int b2 = b1 + 1; b2 < k; b2++)
          for (int a2 = 0; a2 <= b2; a2++) {
            if (dd[b2][a2] == 0) continue;
            bad[b1][a1][b2][a2] = true;
          }
      }
  }
  count(k, 0);
  cout << cnt << '\n';
  return 0;
}
