#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2")
using namespace std;
using lld = long long int;
using pll = pair<lld, lld>;
using lf = double;
using pff = pair<lf, lf>;
using pii = pair<int, int>;
using pli = pair<lld, int>;
using pil = pair<int, lld>;
using piii = pair<int, pii>;
int n, m, p;
piii e[200009];
vector<int> v[200009];
vector<int> rv[10];
const lld vM[10] = {
    1000000007, 1000000009, 998244363, 1000000021, 1000000033,
};
const int ml = 5;
const int el = 11;
struct HZ {
  lld v[ml][el];
  HZ() {
    for (int i = 0; i < ml; i++) {
      for (int j = 0; j < el; j++) {
        v[i][j] = 0;
      }
    }
  }
  void add(int x) {
    for (int i = 0; i < ml; i++) {
      lld z = 1;
      for (int j = 0; j < el; j++) {
        z = (z * x) % vM[i];
        v[i][j] = (v[i][j] + z) % vM[i];
      }
    }
  }
  bool operator==(const HZ& z) {
    for (int i = 0; i < ml; i++) {
      for (int j = 0; j < el; j++) {
        if (v[i][j] != z.v[i][j]) return false;
      }
    }
    return true;
  }
  HZ operator+(const HZ& z) {
    HZ res;
    for (int i = 0; i < ml; i++) {
      for (int j = 0; j < el; j++) {
        res.v[i][j] = (v[i][j] + z.v[i][j]) % vM[i];
      }
    }
    return res;
  }
};
HZ rb[10][10];
bool rbable[10][10];
int res;
HZ az;
void dfs(int dep, HZ s) {
  if (dep == p) {
    if (az == s) {
      res++;
    }
    return;
  }
  for (int i = 0; i <= dep; i++) {
    if (rbable[dep][i]) {
      dfs(dep + 1, s + rb[dep][i]);
    }
  }
}
int main() {
  int i, j, k, l;
  int t = 1, tv = 0;
  while (t--) {
    scanf("%d %d %d", &n, &m, &p);
    for (i = 0; i < m; i++) {
      scanf("%d %d %d", &e[i].second.first, &e[i].second.second, &e[i].first);
    }
    for (i = 0; i < n; i++) {
      az.add(i);
    }
    sort(e, e + m);
    for (i = 0; i < m; i++) {
      v[e[i].second.first - 1].push_back(e[i].second.second - 1);
    }
    for (i = 0; i < n; i++) {
      rv[v[i].size()].push_back(i);
    }
    if (rv[0].size() > 0) {
      printf("0\n");
      continue;
    }
    bitset<200000> s;
    for (i = 1; i <= p; i++) {
      for (k = 0; k < i; k++) {
        bool valid = true;
        s.reset();
        for (j = 0; j < rv[i].size(); j++) {
          int ti = v[rv[i][j]][k];
          if (s[ti]) {
            valid = false;
            break;
          }
          s.set(ti);
          rb[i - 1][k].add(ti);
        }
        rbable[i - 1][k] = valid;
      }
    }
    HZ z;
    dfs(0, z);
    printf("%d\n", res);
  }
  return 0;
}
