#include <bits/stdc++.h>
using namespace std;
namespace IO {
template <class T>
inline void read(T& ret) {
  ret = 0;
  int f = 1;
  char c = getchar();
  while (c < 48 || c > 57) {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= 48 && c <= 57) ret = ret * 10 + c - 48, c = getchar();
  ret *= f;
}
template <class T>
inline void prin(const T& ret) {
  if (!ret) {
    putchar(48);
    return;
  }
  static T o;
  o = ret;
  if (o < 0) {
    putchar('-');
    o = -o;
  }
  static int op[25], tt;
  tt = 0;
  while (o) {
    op[++tt] = o % 10;
    o /= 10;
  }
  for (int i = tt; i; --i) putchar(op[i] + 48);
}
template <class T>
inline void pri_(const T& ret) {
  prin(ret);
  putchar(' ');
}
template <class T>
inline void priE(const T& ret) {
  prin(ret);
  putchar('\n');
}
}  // namespace IO
using namespace IO;
int n, m, k;
vector<pair<int, int> > e[200005];
unsigned long long G1[15][15], G2[15][15], G3[15][15];
int val1[200005], val2[200005], val3[200005], val4[200005];
int a[15];
int ans = 0;
int tmp1, tmp2;
void dfs(int u) {
  if (u == k + 1) {
    if (tmp2 == 0) ans++;
    return;
  }
  for (int i = 1; i <= u; i++) {
    a[u] = i;
    tmp2 ^= G2[u][a[u]];
    dfs(u + 1);
    tmp2 ^= G2[u][a[u]];
  }
}
int main() {
  srand(time(0));
  read(n);
  read(m);
  read(k);
  for (int i = 1; i <= m; i++) {
    int u, v, w;
    read(u);
    read(v);
    read(w);
    e[u].push_back(make_pair(w, v));
  }
  for (int i = 1; i <= n; i++) {
    val1[i] = (unsigned long long)rand() + 1;
    val2[i] = (unsigned long long)rand() * rand() + 1;
    val3[i] = (unsigned long long)rand() * rand() * rand() + 1;
    val4[i] = (unsigned long long)rand() * rand() * rand() * rand() + 1;
  }
  for (int i = 1; i <= n; i++) {
    if (!e[i].size()) {
      puts("0");
      return 0;
    }
    sort(e[i].begin(), e[i].end());
    int cnt = 0;
    for (auto j : e[i]) {
      ++cnt;
      G2[e[i].size()][cnt] ^= (val3[j.second] ^ val3[i]);
    }
  }
  dfs(1);
  cout << ans << endl;
}
