#include <bits/stdc++.h>
#pragma GCC optimize("O2")
#pragma GCC target("avx2")
using namespace std;
const char nl = '\n';
const long long inf = 1e7;
const long long inf2 = 1e18 + 10;
const long double inf3 = 1e14;
const long long mod = 1e9 + 7;
const long double eps = 1e-6;
const int logn = 19;
const int maxn = 200000, maxm = 1e6;
vector<pair<int, int>> g[maxn];
int n, m, k, ans;
vector<int> a[10];
int p[10];
bool gd[10][10][10][10], cnt[maxn];
void solve(int x) {
  if (x > k) {
    ans++;
    return;
  }
  for (int j = 1; j <= x; j++) {
    bool good = true;
    p[x] = j;
    for (int i = 1; i <= x; i++) {
      good = good && gd[i][p[i]][x][j];
    }
    if (good) {
      solve(x + 1);
    }
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  cin >> n >> m >> k;
  for (int i = 0; i < m; i++) {
    int u, v, w;
    cin >> u >> v >> w;
    g[u - 1].emplace_back(w, v - 1);
  }
  for (int i = 0; i < n; i++) {
    sort((g[i]).begin(), (g[i]).end());
  }
  for (int i = 0; i < n; i++) {
    a[(int)g[i].size()].push_back(i);
  }
  for (int i = 1; i <= k; i++) {
    for (int j = 1; j <= i; j++) {
      for (int x = i + 1; x <= k; x++) {
        for (int y = 1; y <= x; y++) {
          for (int v : a[i]) {
            cnt[g[v][j - 1].second] = true;
          }
          bool good = true;
          for (int v : a[x]) {
            if (cnt[g[v][y - 1].second]) {
              good = false;
              break;
            }
            cnt[g[v][y - 1].second] = true;
          }
          gd[i][j][x][y] = good;
          gd[x][y][i][j] = good;
          for (int v : a[i]) {
            cnt[g[v][j - 1].second] = false;
          }
          for (int v : a[x]) {
            cnt[g[v][y - 1].second] = false;
          }
        }
      }
    }
  }
  for (int i = 1; i <= k; i++) {
    for (int j = 1; j <= i; j++) {
      bool good = true;
      for (int v : a[i]) {
        if (cnt[g[v][j - 1].second]) {
          good = false;
          break;
        }
        cnt[g[v][j - 1].second] = true;
      }
      gd[i][j][i][j] = good;
      for (int v : a[i]) {
        cnt[g[v][j - 1].second] = false;
      }
    }
  }
  solve(1);
  cout << ans;
}
