#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int>> adj[200005];
int bad[9][9][9][9];
int cnt[200005][9][9];
int worst[9][9];
int n, m, k;
int get(int x, vector<int> a) {
  if (x == k) {
    return 1;
  }
  int res = 0;
  for (int i = 0; i <= x; ++i) {
    if (worst[x][i]) continue;
    bool poss = true;
    for (int j = 0; j < x && poss; ++j) {
      if (bad[x][i][j][a[j]] > 0) {
        poss = false;
      }
    }
    if (poss) {
      vector<int> b = a;
      b.push_back(i);
      res += get(x + 1, b);
    }
  }
  return res;
}
void solve(int tc) {
  cin >> n >> m >> k;
  for (int i = 0; i < m; ++i) {
    int u, v, w;
    cin >> u >> v >> w;
    adj[u - 1].push_back({w - 1, v - 1});
  }
  for (int i = 0; i < n; ++i) {
    sort((adj[i]).begin(), (adj[i]).end());
    int outdeg = adj[i].size();
    for (int j = 0; j < outdeg; ++j) {
      int v = adj[i][j].second;
      cnt[v][outdeg - 1][j]++;
    }
  }
  for (int i = 0; i < n; ++i) {
    for (int j1 = 0; j1 < 9; ++j1) {
      for (int k1 = 0; k1 < 9; ++k1) {
        if (cnt[i][j1][k1] == 0) continue;
        if (cnt[i][j1][k1] > 1) {
          worst[j1][k1] = 1;
          continue;
        }
        for (int j2 = 0; j2 < 9; ++j2) {
          for (int k2 = 0; k2 < 9; ++k2) {
            if (j1 == j2 && k1 == k2) continue;
            if (cnt[i][j2][k2] > 0) {
              bad[j1][k1][j2][k2] = 1;
              bad[j2][k2][j1][k1] = 1;
            }
          }
        }
      }
    }
  }
  cout << get(0, vector<int>()) << endl;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t = 1;
  for (int tc = 1; tc <= t; ++tc) {
    solve(tc);
  }
  return 0;
}
