#include <bits/stdc++.h>
using namespace std;
const long double pi = 3.141592653589793;
const int mod = 1e9 + 7;
const int mod1 = 1e9 + 7, mod2 = 1e9 + 9;
int n, m, k, x, y, w, cwm1 = 1, cwm2 = 1;
vector<pair<int, int> > g[1 << 20];
int m1[15][15], m2[15][15];
int per[15], ans = 0;
mt19937 mt(chrono::high_resolution_clock::now().time_since_epoch().count());
uniform_int_distribution<int> uf(1, 1e9);
long long v[1 << 20];
void permute(int i) {
  if (i == k + 1) {
    int c1 = 1, c2 = 1;
    for (int i = 1; i <= k; i++) {
      c1 = (c1 * 1LL * m1[i][per[i]]) % mod1;
      c2 = (c2 * 1LL * m2[i][per[i]]) % mod2;
    }
    if (c1 == cwm1 && c2 == cwm2) {
      ans++;
    }
    return;
  }
  for (int j = 1; j <= i; j++) {
    per[i] = j;
    permute(i + 1);
  }
}
void solve() {
  cin >> n >> m >> k;
  for (int i = 1; i <= n; i++) {
    v[i] = uf(mt);
    cwm1 = (cwm1 * 1LL * v[i]) % mod1;
    cwm2 = (cwm2 * 1LL * v[i]) % mod2;
  }
  for (int i = 0; i < m; i++) {
    cin >> x >> y >> w;
    g[x].push_back({w, y});
  }
  for (int i = 1; i <= 10; i++) {
    for (int j = 1; j <= 10; j++) {
      m1[i][j] = m2[i][j] = 1;
    }
  }
  for (int i = 1; i <= n; i++) {
    sort(g[i].begin(), g[i].end());
    int oedge = g[i].size();
    for (int j = 0; j < oedge; j++) {
      m1[oedge][j + 1] = (m1[oedge][j + 1] * 1LL * v[g[i][j].second]) % mod1;
      m2[oedge][j + 1] = (m2[oedge][j + 1] * 1LL * v[g[i][j].second]) % mod2;
    }
  }
  permute(1);
  cout << ans << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
