#include <bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxn = 2e5 + 5, mod = 1e9 + 7, inf = mod;
bool ban[10][10][10][10];
int n, m, k;
vector<pair<int, int> > g[maxn];
multiset<pair<int, int> > in[maxn];
int ans;
int b[maxn];
void back(int i) {
  if (i == k + 1) {
    for (int i1 = (int)1; i1 <= (int)k; i1++) {
      for (int i2 = (int)1; i2 <= (int)k; i2++) {
        if (ban[i1][b[i1]][i2][b[i2]]) {
          return;
        }
      }
    }
    ans++;
  } else {
    for (int j = (int)1; j <= (int)i; j++) {
      b[i] = j;
      back(i + 1);
    }
  }
}
bool cmp(pair<int, int> i, pair<int, int> j) { return i.second < j.second; }
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> m >> k;
  for (int i = (int)1; i <= (int)m; i++) {
    int u, v, w;
    cin >> u >> v >> w;
    g[u].emplace_back(v, w);
  }
  for (int i = (int)1; i <= (int)n; i++) {
    sort(begin(g[i]), end(g[i]), cmp);
    int t = g[i].size();
    for (int j = (int)0; j <= (int)t - 1; j++) {
      int v = g[i][j].first;
      if (in[v].count({t, j + 1}) > 1) continue;
      in[v].emplace(t, j + 1);
    }
  }
  for (int i = (int)1; i <= (int)n; i++) {
    for (pair<int, int> a : in[i])
      if (in[i].count(a) >= 2) {
        ban[a.first][a.second][a.first][a.second] = 1;
      }
    for (pair<int, int> a : in[i]) {
      for (pair<int, int> b : in[i]) {
        if (a == b) continue;
        ban[a.first][a.second][b.first][b.second] = 1;
      }
    }
  }
  back(1);
  cout << ans;
}
