#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
vector<pair<int, int> > lik[maxn];
vector<int> out[maxn];
int rk[maxn][10];
int n, m, k;
int in[maxn];
int base1 = 31, base2 = 57;
unsigned long long ha1[10][10], ha2[10][10];
unsigned long long ph1[maxn], ph2[maxn];
unsigned long long tar1, tar2;
bool cmp(pair<int, int> lhs, pair<int, int> rhs) {
  return lhs.second < rhs.second;
}
void init() {
  scanf("%d%d%d", &n, &m, &k);
  for (int i = 1; i <= n; ++i) {
    ph1[i] = ph1[i - 1] * base1 + i;
    ph2[i] = ph2[i - 1] * base2 + i;
  }
  int u, v, w;
  for (int i = 0; i < m; ++i) {
    scanf("%d%d%d", &u, &v, &w);
    lik[u].push_back(pair<int, int>(v, w));
  }
  for (int i = 1; i <= n; ++i) {
    sort(lik[i].begin(), lik[i].end(), cmp);
    for (int j = 0; j < lik[i].size(); ++j) rk[i][j + 1] = lik[i][j].first;
    out[lik[i].size()].push_back(i);
    tar1 += ph1[i];
    tar2 += ph2[i];
  }
  for (int i = 1; i <= k; ++i)
    for (int j = 1; j <= i; ++j)
      for (auto u : out[i])
        ha1[i][j] += ph1[rk[u][j]], ha2[i][j] += ph2[rk[u][j]];
}
int ans;
void dfs(int s, unsigned long long h1, unsigned long long h2) {
  if (s > k) {
    if (h1 == tar1 && h2 == tar2) ++ans;
    return;
  }
  for (int c = 1; c <= s; ++c) {
    dfs(s + 1, h1 + ha1[s][c], h2 + ha2[s][c]);
  }
}
void sol() {
  dfs(1, 0, 0);
  printf("%d\n", ans);
}
int main() {
  int T;
  {
    init();
    sol();
  }
  return 0;
}
