#include <bits/stdc++.h>
using namespace std;
int n, m, k, ch[10][10][10][10], per[10];
vector<pair<int, int>> out[200001];
int in[200001][10][10];
int solve(int cur) {
  if (cur == k) {
    for (int i = 1; i <= k; i++) {
      for (int j = i; j <= k; j++) {
        if (ch[i][per[i]][j][per[j]]) {
          return 0;
        }
      }
    }
    return 1;
  }
  int ret = 0;
  for (int i = 1; i <= cur + 1; i++) {
    per[cur + 1] = i;
    ret += solve(cur + 1);
    per[cur + 1] = 0;
  }
  return ret;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  ;
  cin >> n >> m >> k;
  for (int i = 1; i <= m; i++) {
    int u, v, w;
    cin >> u >> v >> w;
    out[u].push_back({w, v});
  }
  for (int i = 1; i <= n; i++) {
    sort(out[i].begin(), out[i].end());
    int sz = out[i].size();
    for (int j = 1; j <= sz; j++) {
      in[out[i][j - 1].second][sz][j]++;
    }
  }
  for (int i = 1; i <= n; i++) {
    for (int a = 1; a <= k; a++) {
      for (int b = 1; b <= a; b++) {
        for (int c = 1; c <= k; c++) {
          for (int d = 1; d <= c; d++) {
            if (a == c && b == d) continue;
            if (in[i][a][b] != 0 && in[i][c][d] != 0) ch[a][b][c][d] = 1;
          }
        }
        if (in[i][a][b] >= 2) ch[a][b][a][b] = 1;
      }
    }
  }
  cout << solve(0);
  return 0;
}
