#include <bits/stdc++.h>
constexpr int maxn = 200000;
constexpr int maxm = 200000;
constexpr int maxk = 9;
constexpr int ix(int i, int j) { return (i * (i - 1) >> 1) + j; }
constexpr int maxix = ix(maxk + 1, 0);
struct Edge {
  int u;
  int v;
  int w;
};
bool operator<(Edge e0, Edge e1) { return e0.w < e1.w; }
int outDegree[maxn + 1];
int usedOutDegree[maxn + 1];
Edge es[maxm];
int incl[maxn + 1][maxix];
bool taboo[maxix][maxix];
int main() {
  using namespace std;
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int n, m, k;
  cin >> n >> m >> k;
  for (int i = 0; i < m; ++i) {
    int u, v, w;
    cin >> u >> v >> w;
    es[i] = Edge{u, v, w};
    ++outDegree[u];
  }
  sort(es, es + m);
  for (int i = 0; i < m; ++i) {
    const Edge e = es[i];
    const int p = outDegree[e.u];
    int& q = usedOutDegree[e.u];
    incl[e.v][ix(p, q++)] += 1;
  }
  for (int i = 1; i <= n; ++i)
    for (int p = 0; p < maxix; ++p)
      if (incl[i][p] == 1)
        for (int q = p + 1; q < maxix; ++q)
          taboo[p][q] = taboo[p][q] || incl[i][q];
      else
        taboo[p][p] = taboo[p][p] || incl[i][p] > 1;
  int tuple[maxk + 1];
  int offsets[maxk + 1];
  for (int i = 1; i <= k; ++i) {
    tuple[i] = 0;
    offsets[i] = ix(i, 0);
  }
  auto incr = [&]() {
    for (int i = 1; i <= k; ++i)
      if (tuple[i] < i - 1) {
        ++tuple[i];
        return true;
      } else
        tuple[i] = 0;
    return false;
  };
  auto isValid = [&]() {
    for (int i = 1; i <= k; ++i) {
      const int p = tuple[i] + offsets[i];
      for (int j = i; j <= k; ++j)
        if (taboo[p][tuple[j] + offsets[j]]) return false;
    }
    return true;
  };
  int ct = 0;
  do ct += isValid();
  while (incr());
  cout << ct << '\n';
  return 0;
}
