#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
const int K = 10;
bool can[K][K][K][K], good[K][K];
int in[N][K][K];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, m, k;
  cin >> n >> m >> k;
  vector<int> from(m), to(m);
  for (int i = 0; i < m; i++) {
    int x, y, z;
    cin >> x >> y >> z;
    x--;
    y--;
    z--;
    from[z] = x;
    to[z] = y;
  }
  vector<vector<int>> out(n);
  for (int i = 0; i < m; i++) out[from[i]].push_back(to[i]);
  for (int i = 0; i < n; i++) {
    int sz = out[i].size();
    for (int j = 0; j < sz; j++) in[out[i][j]][sz][j]++;
  }
  for (int i = 1; i <= k; i++)
    for (int ci = 0; ci < i; ci++)
      for (int j = 1; j <= k; j++)
        for (int cj = 0; cj < j; cj++) can[i][ci][j][cj] = 1;
  for (int i = 1; i <= k; i++)
    for (int ci = 0; ci < i; ci++) good[i][ci] = 1;
  for (int v = 0; v < n; v++)
    for (int i = 1; i <= k; i++)
      for (int ci = 0; ci < i; ci++) {
        if (in[v][i][ci] >= 2) good[i][ci] = 0;
        if (in[v][i][ci] > 0)
          for (int j = 1; j < i; j++)
            for (int cj = 0; cj < j; cj++)
              if (in[v][j][cj] > 0) can[i][ci][j][cj] = 0;
      }
  vector<int> c(k + 1);
  int ans = 0;
  function<void(int)> bkt = [&](int v) {
    if (v == k + 1) {
      ans++;
      return;
    }
    c[v] = 0;
    while (c[v] < v) {
      bool ok = good[v][c[v]];
      for (int i = 1; i < v; i++) {
        if (!can[v][c[v]][i][c[i]]) {
          ok = false;
          break;
        }
      }
      if (ok) bkt(v + 1);
      c[v]++;
    }
  };
  bkt(1);
  cout << ans << "\n";
}
