#include <bits/stdc++.h>
using namespace std;
mt19937 mt_rand(
    chrono::high_resolution_clock::now().time_since_epoch().count());
const int N = 2e5 + 5, HS = 3, K = 10;
int n, m, k;
vector<pair<int, int> > g[N];
int mod[HS];
struct hash_number {
  int a[HS];
  hash_number() { fill(a, a + HS, 0); }
  hash_number(long long x) {
    for (int i = (0); i <= (HS - 1); ++i) a[i] = (x % mod[i] + mod[i]) % mod[i];
  }
  hash_number operator+(hash_number x) {
    hash_number res;
    res.a[0] = (a[0] + x.a[0]) % mod[0];
    res.a[1] = (a[1] * 1ll * x.a[1]) % mod[1];
    res.a[2] = (a[2] + x.a[2]) % mod[2];
    return res;
  }
  bool operator==(const hash_number& x) const {
    for (int i = (0); i <= (HS - 1); ++i)
      if (a[i] != x.a[i]) return 0;
    return 1;
  }
} val[N], c[K][K], s;
int ans;
int status[K];
void dfs(int x, hash_number hsh) {
  if (x == k) {
    if (hsh == s) ++ans;
    return;
  }
  for (int i = (1); i <= (x + 1); ++i) {
    status[x + 1] = i;
    dfs(x + 1, hsh + c[x + 1][i]);
  }
}
int main() {
  mod[0] = 998244353;
  mod[1] = 1e9 + 7;
  mod[2] = std::uniform_int_distribution<int>(1e8, 1e9)(mt_rand);
  fprintf(stderr, "%d %d %d\n", mod[0], mod[1], mod[2]);
  scanf("%d%d%d", &n, &m, &k);
  for (int i = (1); i <= (m); ++i) {
    int u, v, w;
    scanf("%d%d%d", &u, &v, &w);
    g[u].push_back({w, v});
  }
  std::uniform_int_distribution<long long> rg(1, 1e18);
  for (int i = (1); i <= (n); ++i) val[i] = hash_number(rg(mt_rand));
  for (int i = (1); i <= (n); ++i) s = s + val[i];
  for (int u = (1); u <= (n); ++u) {
    int d = g[u].size();
    sort(g[u].begin(), g[u].end());
    for (int i = 1; i <= g[u].size(); ++i) {
      int v = g[u][i - 1].second;
      c[d][i] = c[d][i] + val[v];
    }
  }
  dfs(0, hash_number());
  printf("%d\n", ans);
  return 0;
}
