#include <bits/stdc++.h>
using namespace std;
const int maxN = 200005;
const int n_mods = 2;
const int mod[n_mods] = {1000000007, 1000000009};
mt19937 mt_rand(
    chrono::high_resolution_clock::now().time_since_epoch().count());
struct HashNumber {
  long long xs[n_mods];
  HashNumber() {
    for (int i = 0; i < n_mods; ++i) xs[i] = 0;
  }
  HashNumber(long long x) {
    for (int i = 0; i < n_mods; ++i) xs[i] = x % mod[i];
  }
  HashNumber operator+(HashNumber other) {
    HashNumber x;
    for (int i = 0; i < n_mods; ++i) x.xs[i] = (xs[i] + other.xs[i]) % mod[i];
    return x;
  }
  bool operator==(HashNumber other) {
    for (int i = 0; i < n_mods; ++i) {
      if (xs[i] != other.xs[i]) return false;
    }
    return true;
  }
};
int N, M, K;
vector<pair<int, int>> graph[maxN];
HashNumber target, S[10][10], val[maxN];
bool cmp(pair<int, int> a, pair<int, int> b) { return a.second < b.second; }
int solve(int k, HashNumber s) {
  if (k == K) {
    if (s == target) return 1;
    return 0;
  }
  int ans = 0;
  for (int i = 0; i <= k; ++i) {
    ans += solve(k + 1, s + S[k + 1][i + 1]);
  }
  return ans;
}
int main() {
  cin.sync_with_stdio(0);
  cin.tie(0);
  cin >> N >> M >> K;
  for (int i = 0; i < M; ++i) {
    int u, v, w;
    cin >> u >> v >> w;
    graph[u].push_back({v, w});
  }
  std::uniform_int_distribution<long long> interval(1, (long long)1e18);
  for (int i = 1; i <= N; ++i) val[i] = HashNumber(interval(mt_rand));
  for (int i = 1; i <= N; ++i) target = target + val[i];
  for (int i = 1; i <= N; ++i) {
    sort(graph[i].begin(), graph[i].end(), cmp);
    int sz = (int)graph[i].size();
    for (int j = 0; j < sz; ++j) {
      S[sz][j + 1] = S[sz][j + 1] + val[graph[i][j].first];
    }
  }
  printf("%d\n", solve(0, HashNumber()));
  return 0;
}
