#include <bits/stdc++.h>
using namespace std;
inline long long read() {
  long long x = 0, f = 1;
  char c = getchar();
  while (c != '-' && (c < '0' || c > '9')) c = getchar();
  if (c == '-') f = -1, c = getchar();
  while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
  return f * x;
}
const long long N = 2e5 + 7;
const long long M = 1e9 + 7;
const long long MAXN = 2e18 + 7;
const long long Mod = 998244353;
long long _, i, j, k, n, m, p, q, s, T, t, l, r, o, u, v, w, x, y, z, ans, nex,
    num, st, en, sx, sy, tx, ty, len, th, ma, mi, mod, sum, res, flag, cas, ret,
    mid, cnt, now, tmp;
long long a[N], b[N], c[10][10][10][10], d[N], mp[10][10];
char ch;
vector<pair<long long, long long> > g[N], h[N], f;
string s1, s2, s3, ss;
void dfs(long long cnt) {
  if (cnt == k + 1) {
    ans++;
    return;
  }
  long long i;
  for (long long x = 0; x < cnt; x++) {
    d[cnt] = x;
    for (i = 1; i <= cnt; i++)
      if (c[i][d[i]][cnt][x]) break;
    if (i <= cnt) continue;
    dfs(cnt + 1);
  }
}
signed main() {
  ios::sync_with_stdio(false);
  long long T = 1;
  while (T--) {
    n = read();
    m = read();
    k = read();
    for (i = 1; i <= m; i++) {
      u = read();
      v = read();
      w = read();
      g[u].push_back(pair<long long, long long>(w, v));
      d[u]++;
      b[v]++;
    }
    for (i = 1; i <= n; i++) {
      if (d[i] == 0 || b[i] == 0) break;
    }
    if (i <= n) {
      printf("0\n");
      continue;
    }
    for (i = 1; i <= n; i++) sort((g[i]).begin(), (g[i]).end());
    for (i = 1; i <= n; i++) {
      for (j = 0; j < g[i].size(); j++) {
        v = g[i][j].second;
        h[v].push_back(pair<long long, long long>(d[i], j));
      }
    }
    for (i = 1; i <= n; i++) {
      sort((h[i]).begin(), (h[i]).end());
      for (l = 1; l <= k; l++)
        for (j = 0; j < l; j++) mp[l][j] = 0;
      for (j = 0; j < h[i].size(); j++) {
        if (mp[h[i][j].first][h[i][j].second])
          c[h[i][j].first][h[i][j].second][h[i][j].first][h[i][j].second] = 1;
        mp[h[i][j].first][h[i][j].second] = 1;
      }
      f.clear();
      for (l = 1; l <= k; l++)
        for (j = 0; j < l; j++)
          if (mp[l][j]) f.push_back(pair<long long, long long>(l, j));
      for (l = 0; l < f.size(); l++)
        for (j = l + 1; j < f.size(); j++) {
          c[f[l].first][f[l].second][f[j].first][f[j].second] = 1;
        }
    }
    ans = 0;
    dfs(1);
    printf("%lld\n", ans);
  }
  return 0;
}
