#include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
inline int read() {
  int x = 0;
  int f = 0;
  char ch = 0;
  while (!isdigit(ch)) {
    f |= (ch == '-') ? 1 : 0;
    ch = getchar();
  }
  while (isdigit(ch)) {
    x = (x << 3) + (x << 1) + (ch ^ 48);
    ch = getchar();
  }
  return f ? -x : x;
}
const int mod = 1e9 + 7;
const int maxn = 2e5 + 10;
int n, m, k;
struct node {
  int to, nxt, key;
} edge[maxn << 1];
int head[maxn], tot = 0;
int out[maxn];
int hash1[maxn], hash2[maxn];
int hash3[maxn], hash4[maxn];
vector<int> vv[15];
struct node1 {
  int v, c;
  bool operator<(const node1 a) const { return c > a.c; }
};
set<node1> sset[maxn];
set<node1>::iterator it;
long long ans1[15][15];
long long ans2[15][15];
long long ans3[15][15];
long long ans4[15][15];
inline void add(int u, int v, int w) { sset[u].insert((node1){v, w}); }
long long num1, num2, num3, num4;
inline void init() {
  srand(time(0));
  n = read();
  m = read();
  k = read();
  num1 = num2 = num3 = num4 = 1;
  for (int i = 1; i <= n; ++i)
    hash1[i] = rand(), hash2[i] = rand(), num1 = num1 * hash1[i] % mod,
    num2 = num2 * hash2[i] % mod;
  for (int i = 1; i <= n; ++i)
    hash3[i] = rand(), hash4[i] = rand(), num3 = num3 * hash3[i] % mod,
    num4 = num4 * hash4[i] % mod;
  for (int i = 1; i <= n; ++i) sset[i].clear(), out[i] = 0;
  for (int i = 1; i <= m; ++i) {
    int u = read();
    int v = read();
    int w = read();
    add(u, v, w);
    ++out[u];
  }
  for (int i = 1; i <= k; ++i) vv[i].clear();
  for (int i = 1; i <= k; ++i)
    for (int j = 1; j <= k; ++j)
      ans1[i][j] = ans2[i][j] = ans3[i][j] = ans4[i][j] = 1;
}
int st[maxn];
int num = 0;
long long res;
inline void dfs(int step) {
  if (step == k) {
    long long tmp = 1;
    int flag = 0;
    for (int i = 1; i <= k; ++i) {
      int j = st[i];
      tmp = tmp * ans1[i][j] % mod;
    }
    if (tmp != num1) flag = 1;
    tmp = 1;
    for (int i = 1; i <= k; ++i) {
      int j = st[i];
      tmp = tmp * ans2[i][j] % mod;
    }
    if (tmp != num2) flag = 1;
    tmp = 1;
    for (int i = 1; i <= k; ++i) {
      int j = st[i];
      tmp = tmp * ans3[i][j] % mod;
    }
    if (tmp != num3) flag = 1;
    tmp = 1;
    for (int i = 1; i <= k; ++i) {
      int j = st[i];
      tmp = tmp * ans4[i][j] % mod;
    }
    if (tmp != num4) flag = 1;
    if (!flag) ++res;
    return;
  }
  for (int i = 1; i <= step + 1; ++i) {
    st[++num] = i;
    dfs(step + 1);
    --num;
  }
}
inline void solve() {
  for (int i = 1; i <= k; ++i) {
    for (int j = 1; j <= n; ++j)
      if (out[j] == i) vv[i].push_back(j);
  }
  for (int i = 1; i <= k; ++i) {
    for (int j = 0; j < vv[i].size(); ++j) {
      int tmp = vv[i][j];
      int o = 0;
      for (it = sset[tmp].begin(); it != sset[tmp].end(); ++it) {
        ++o;
        int v = (*it).v;
        ans1[i][o] = ans1[i][o] * hash1[v] % mod;
        ans2[i][o] = ans2[i][o] * hash2[v] % mod;
        ans3[i][o] = ans3[i][o] * hash3[v] % mod;
        ans4[i][o] = ans4[i][o] * hash4[v] % mod;
      }
    }
  }
  res = 0;
  dfs(0);
  printf("%lld\n", res);
}
int main() {
  init();
  solve();
}
