#include <bits/stdc++.h>
using namespace std;
const int mod1 = 1e9 + 7;
const int mod2 = 998244353;
long long c[100][100], c2[100][100];
vector<pair<int, int> > g[200010];
bool prime[5000000];
int p[500000], tot = 0;
void gt_prime() {
  for (int i = 2; i < 5000000; i++) {
    if (!prime[i]) p[++tot] = i;
    for (int j = 1; j <= tot && p[j] * i < 5000000; j++) {
      prime[i * p[j]] = 1;
      if (i % p[j] == 0) break;
    }
  }
}
int main() {
  gt_prime();
  int n, m, k;
  scanf("%d%d%d", &n, &m, &k);
  for (int i = 0; i < m; i++) {
    int u, v, k;
    scanf("%d%d%d", &u, &v, &k);
    g[u].push_back({k, v});
  }
  for (int i = 0; i < 10; i++) {
    for (int j = 0; j < 10; j++) {
      c[i][j] = 1;
      c2[i][j] = 1;
    }
  }
  for (int i = 1; i <= n; i++) {
    int nl = (int)g[i].size();
    if (nl > 1) sort(g[i].begin(), g[i].end());
    for (int j = 0; j < nl; j++) {
      int x = g[i][j].second;
      c[nl][j + 1] *= p[x];
      c[nl][j + 1] %= mod1;
      c2[nl][j + 1] *= p[x];
      c2[nl][j + 1] %= mod2;
    }
  }
  int d[19];
  for (int i = 1; i <= 9; i++) {
    d[i] = 1;
  }
  long long res1 = 1;
  long long res2 = 1;
  for (int i = 1; i <= n; i++) {
    res1 = (res1 * p[i]) % mod1;
    res2 = (res2 * p[i]) % mod2;
  }
  int cnt = 0, cishu = 0;
  while (1) {
    long long ans1 = 1;
    long long ans2 = 1;
    for (int i = 1; i <= 9; i++) {
      ans1 = ans1 * c[i][d[i]] % mod1;
      ans2 = ans2 * c2[i][d[i]] % mod2;
    }
    if (ans1 == res1 && ans2 == res2) cnt++;
    cishu++;
    if (cishu == 362880) break;
    d[9]++;
    int pxr = 9;
    while (pxr != 1 && d[pxr] > pxr) {
      d[pxr] = 1;
      d[pxr - 1]++;
      pxr--;
    }
    if (d[1] == 2) break;
  }
  for (int i = k + 1; i <= 9; i++) cnt /= i;
  cout << cnt << endl;
  return 0;
}
