#include <bits/stdc++.h>
using namespace std;
struct frez {
  int u, v, w, r, in;
} a[200050];
bool cmp1(frez a, frez b) { return a.u == b.u ? a.w < b.w : a.u < b.u; }
bool cmp2(frez a, frez b) { return a.v < b.v; }
int n, m, K, ans, cnt[15][15], c[20], deg[200050];
bool vis[15][15][15][15];
void dfs(int x) {
  if (x == K + 1) {
    ans++;
    return;
  }
  for (int i = 1; i <= x; i++) {
    bool pd = 1;
    c[x] = i;
    for (int j = 1; j <= x; j++)
      if (!vis[j][c[j]][x][i]) pd = 0;
    if (!pd) continue;
    dfs(x + 1);
  }
}
int main() {
  scanf("%d%d%d", &n, &m, &K);
  for (int i = 1; i <= m; i++)
    scanf("%d%d%d", &a[i].u, &a[i].v, &a[i].w), deg[a[i].v]++;
  for (int i = 1; i <= n; i++)
    if (!deg[i]) {
      printf("0\n");
      return 0;
    }
  sort(a + 1, a + m + 1, cmp1);
  for (int i = 1, j = 1; i <= m; i = j) {
    for (; a[i].u == a[j].u && j <= m; j++)
      ;
    for (int k = i; k < j; k++) a[k].r = k - i + 1, a[k].in = j - i;
  }
  sort(a + 1, a + m + 1, cmp2);
  for (int aa = 1; aa <= 9; aa++)
    for (int bb = 1; bb <= 9; bb++)
      for (int cc = 1; cc <= 9; cc++)
        for (int dd = 1; dd <= 9; dd++) vis[aa][bb][cc][dd] = 1;
  for (int i = 1, j = 1; i <= m; i++) {
    memset(cnt, 0, sizeof(cnt));
    for (; a[i].v == a[j].v && j <= m; j++) cnt[a[j].in][a[j].r]++;
    for (int aa = 1; aa <= 9; aa++)
      for (int bb = 1; bb <= aa; bb++)
        if (cnt[aa][bb])
          for (int cc = 1; cc <= 9; cc++)
            for (int dd = 1; dd <= cc; dd++)
              if (cnt[cc][dd]) {
                if (aa == cc && bb == dd && cnt[aa][bb] == 1) continue;
                vis[aa][bb][cc][dd] = 0;
              }
  }
  dfs(1);
  printf("%d\n", ans);
  return 0;
}
