#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;
bitset<200000> bs[9][9];
int allowed[9][9][9];
ll n, m, k;
ll solve(int pos, int val, array<int, 9> still) {
  ll sum = 0;
  for (int i = (pos + 1); i < (k); ++i) {
    still[i] &= allowed[pos][val][i];
    if (still[i] == 0) return 0;
  }
  if (pos == k - 2) {
    return __builtin_popcount(still[k - 1]);
  }
  int del = 0;
  for (int mask = still[pos + 1]; mask; mask &= ~del) {
    del = mask & (-mask);
    sum += solve(pos + 1, __builtin_ctz(del), still);
  }
  return sum;
}
int main(int argc, char* argv[]) {
  std::ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.precision(10);
  cin >> n >> m >> k;
  array<int, 9> still = {};
  for (int i = (0); i < (k); ++i) still[i] = (1u << (i + 1)) - 1;
  vector<vector<pii>> g(n);
  for (int i = (0); i < (m); ++i) {
    int u, v, w;
    cin >> u >> v >> w;
    u--, v--;
    g[u].push_back({w, v});
  }
  for (auto& a : g) sort((a).begin(), (a).end());
  for (int u = (0); u < (n); ++u) {
    for (int i = (0); i < (g[u].size()); ++i) {
      if (bs[g[u].size() - 1][i][g[u][i].second]) {
        still[g[u].size() - 1] &= ~(1u << i);
      }
      bs[g[u].size() - 1][i][g[u][i].second] = true;
    }
  }
  for (int d1 = (0); d1 < (k); ++d1)
    for (int v1 = (0); v1 < (d1 + 1); ++v1)
      for (int d2 = (d1 + 1); d2 < (k); ++d2) {
        allowed[d1][v1][d2] = (1u << (d2 + 1)) - 1;
        for (int v2 = (0); v2 < (d2 + 1); ++v2) {
          if ((bs[d1][v1] & bs[d2][v2]).any()) {
            allowed[d1][v1][d2] &= ~(1u << v2);
          }
        }
      }
  if (k == 1)
    cout << still[0] << '\n';
  else
    cout << (still[0] ? solve(0, 0, still) : 0ll) << '\n';
  cout.flush();
  return 0;
}
