#include <bits/stdc++.h>
using namespace std;
const long long M = 1e9 + 7;
const long long mod = 998244353;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
const long long FIXED_RANDOM =
    chrono::steady_clock::now().time_since_epoch().count();
struct Hash {
  long long val1 = 1;
  Hash() {}
  Hash(long long a) { val1 = a; }
  Hash operator*(const Hash &nxt) const { return Hash(val1 * nxt.val1 % M); }
  void operator=(const Hash &nxt) { val1 = nxt.val1; }
  void operator*=(const Hash &nxt) { val1 = nxt.val1 * val1 % M; }
  Hash calc_Hash(const long long &x) { return (x + FIXED_RANDOM) % M; }
  bool operator==(const Hash &nxt) const { return val1 == nxt.val1; }
};
int n, m, k;
vector<pair<int, int> > adj[200200];
Hash vals[200200], tot, S[10][10];
int out[200200];
int ans = 0;
void recurse(int i, Hash h) {
  if (i == k + 1) {
    if (h == tot) ans++;
    return;
  }
  for (int j = 1; j <= i; j++) {
    recurse(i + 1, S[i][j] * h);
  }
}
void solve() {
  cin >> n >> m >> k;
  for (int i = 1; i <= n; i++) {
    vals[i] = vals[i].calc_Hash(i);
    tot *= vals[i];
  }
  for (int i = 0; i < m; i++) {
    int a, b, w;
    cin >> a >> b >> w;
    adj[a].push_back({b, w});
    out[a]++;
  }
  for (int i = 1; i <= n; i++) {
    sort(adj[i].begin(), adj[i].end(), [&](pair<int, int> a, pair<int, int> b) {
      return a.second < b.second;
    });
    for (int j = 0; j < out[i]; j++) {
      S[out[i]][j + 1] *= vals[adj[i][j].first];
    }
  }
  Hash h;
  recurse(1, h);
  cout << ans << endl;
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t--) {
    solve();
  }
}
