#include <bits/stdc++.h>
using namespace std;
int min(int a, int b) { return a < b ? a : b; }
int max(int a, int b) { return a > b ? a : b; }
void bmax(int &a, int b) { a = (a > b) ? a : b; }
void bmin(int &a, int b) { a = (a < b) ? a : b; }
const int L = 1 << 20;
char buf[L], *p1, *p2;
int read() {
  int x = 0, w = 1;
  char ch = (p1 == p2 ? (p2 = buf + fread(p1 = buf, 1, L, stdin),
                         p1 == p2 ? EOF : *p1++)
                      : *p1++);
  while (ch > '9' || ch < '0') {
    if (ch == '-') w = -1;
    ch = (p1 == p2 ? (p2 = buf + fread(p1 = buf, 1, L, stdin),
                      p1 == p2 ? EOF : *p1++)
                   : *p1++);
  }
  while (ch <= '9' && ch >= '0')
    x = x * 10 + ch - '0',
    ch = (p1 == p2 ? (p2 = buf + fread(p1 = buf, 1, L, stdin),
                      p1 == p2 ? EOF : *p1++)
                   : *p1++);
  return x * w;
}
const int N = 2e5 + 5, base = 13331;
vector<pair<int, int> > g[N];
unsigned long long las, a[20][20], powe[N];
int n, m, k, ans;
void DFS(int u, unsigned long long nw) {
  if (u == k + 1) {
    ans += (nw == las);
    return;
  }
  for (int i = 1; i <= u; i++) DFS(u + 1, nw + a[u][i]);
}
int main() {
  n = read();
  m = read();
  k = read();
  for (int i = 1, u, v, w; i <= m; i++)
    u = read(), v = read(), w = read(), g[u].push_back(make_pair(w, v));
  powe[0] = 1;
  las = 0;
  for (int i = 1; i <= n; i++) powe[i] = powe[i - 1] * base, las += powe[i];
  for (int i = 1; i <= n; i++) {
    sort(g[i].begin(), g[i].end());
    int tot = g[i].size();
    for (int j = 0; j < tot; j++) a[tot][j + 1] += powe[g[i][j].second];
  }
  ans = 0;
  DFS(1, 0);
  printf("%d\n", ans);
  return 0;
}
