#include <bits/stdc++.h>
using namespace std;
const int N = 200000, M = 10;
int n, m, sk;
struct state {
  int x, y;
  state(int X = 0, int Y = 0) {
    x = X;
    y = Y;
  }
  bool operator<(const state &p) const {
    return y < p.y || y == p.y && x < p.x;
  }
};
vector<state> e[N + 9];
int deg[N + 9];
set<state> s[N + 9];
int b[M + 9][M + 9][M + 9][M + 9];
int vis[M + 9][M + 9];
int ans;
void Dfs_ans(int k) {
  if (k > sk) {
    ++ans;
    return;
  }
  for (int i = 1; i <= k; ++i)
    if (!vis[k][i]) {
      for (int j = 1; j <= sk; ++j)
        for (int t = 1; t <= sk; ++t)
          if (b[k][i][j][t]) ++vis[j][t];
      Dfs_ans(k + 1);
      for (int j = 1; j <= sk; ++j)
        for (int t = 1; t <= sk; ++t)
          if (b[k][i][j][t]) --vis[j][t];
    }
}
state now[N + 9];
int cn;
void work() {
  scanf("%d%d%d", &n, &m, &sk);
  for (int i = 1; i <= m; ++i) {
    int x, y, v;
    scanf("%d%d%d", &x, &y, &v);
    e[x].push_back(state(y, v));
    ++deg[x];
  }
  for (int i = 1; i <= n; ++i) sort(e[i].begin(), e[i].end());
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= deg[i]; ++j) {
      if (s[e[i][j - 1].x].find(state(deg[i], j)) != s[e[i][j - 1].x].end())
        ++vis[deg[i]][j];
      s[e[i][j - 1].x].insert(state(deg[i], j));
    }
  for (int i = 1; i <= n; ++i) {
    cn = 0;
    for (set<state>::iterator it = s[i].begin(); it != s[i].end(); ++it)
      now[++cn] = *it;
    for (int i = 1; i <= cn; ++i)
      for (int j = 1; j <= cn; ++j)
        b[now[i].x][now[i].y][now[j].x][now[j].y] = 1;
  }
  Dfs_ans(1);
  printf("%d\n", ans);
}
int main() {
  int T = 1;
  for (; T--;) work();
  return 0;
}
