#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const double PI = acos((long double)-1.0);
const double EPS = 1e-10;
const int MOD = 1e9 + 7;
template <typename T>
void cmin(T &x, T y) {
  if (y < x) x = y;
}
template <typename T>
void cmax(T &x, T y) {
  if (y > x) x = y;
}
long long qpow(long long x, long long n, long long mod = MOD) {
  if (n < 0) return 0;
  long long res = 1;
  while (n) {
    if (n & 1) res = res * x % mod;
    x = x * x % mod;
    n >>= 1;
  }
  return res;
}
long long sq(long long x) { return x * x; }
long long read() {
  long long res = 0;
  char c = getchar();
  while (!isdigit(c)) c = getchar();
  while (isdigit(c)) {
    res = res * 10 + (c - '0');
    c = getchar();
  }
  return res;
}
namespace Solver {
void InitOnce() { int t; }
int n, m, k;
vector<pair<int, int> > G[200005];
unsigned long long hc1[200005], hc2[200005];
unsigned long long To1[10][10], To2[10][10];
void Read() {
  int res = scanf("%d%d%d", &n, &m, &k);
  if (res == -1) exit(0);
  for (int i = 1; i <= n; ++i) G[i].clear();
  for (int i = 1; i <= m; ++i) {
    int u, v, w;
    scanf("%d%d%d", &u, &v, &w);
    G[u].emplace_back(w, v);
  }
  mt19937_64 rnd;
  rnd.seed(19981111);
  for (int i = 1; i <= n; ++i) {
    sort(G[i].begin(), G[i].end());
    hc1[i] = rnd();
    hc2[i] = rnd();
  }
  for (int i = 0; i <= 9; ++i) {
    for (int j = 0; j <= 9; ++j) {
      To1[i][j] = 0;
      To2[i][j] = 0;
    }
  }
  for (int u = 1; u <= n; ++u) {
    int sz = G[u].size();
    for (int i = 0; i < sz; ++i) {
      int v = G[u][i].second;
      To1[sz][i + 1] ^= hc1[v];
      To2[sz][i + 1] ^= hc2[v];
    }
  }
}
unsigned long long okcode1, okcode2;
unsigned long long code1, code2;
int ans;
void dfs(int pos, int val) {
  code1 ^= To1[pos][val];
  code2 ^= To2[pos][val];
  if (pos == k)
    ans += (code1 == okcode1) && (code2 == okcode2);
  else {
    for (int i = 1; i <= pos + 1; ++i) dfs(pos + 1, i);
  }
  code1 ^= To1[pos][val];
  code2 ^= To2[pos][val];
  return;
}
void Solve() {
  code1 = 0;
  okcode1 = 0;
  code2 = 0;
  okcode2 = 0;
  for (int i = 1; i <= n; ++i) okcode1 ^= hc1[i];
  for (int i = 1; i <= n; ++i) okcode2 ^= hc2[i];
  ans = 0;
  dfs(1, 1);
  printf("%d\n", ans);
}
}  // namespace Solver
int main() {
  Solver::InitOnce();
  while (true) {
    Solver::Read();
    Solver::Solve();
  }
  return 0;
}
