#include <bits/stdc++.h>
using namespace std;
int n, m, k, eu, ev, ew;
vector<pair<int, int> > ga[200100];
struct set_hash {
  long long hs[3], mo[3];
  set_hash() {
    mo[0] = 998244353;
    mo[1] = 1000000007;
    mo[2] = 13331;
    hs[0] = 0;
    hs[1] = 1;
    hs[2] = 0;
  }
  set_hash(long long v) {
    mo[0] = 998244353;
    mo[1] = 1000000007;
    mo[2] = 13331;
    hs[0] = v;
    hs[1] = v;
    hs[2] = v;
  }
  set_hash operator+(set_hash v) {
    set_hash w;
    w.hs[0] = (hs[0] + v.hs[0]) % mo[0];
    w.hs[1] = (hs[1] * v.hs[1]) % mo[1];
    w.hs[2] = (hs[2] + v.hs[2]) % mo[2];
    return w;
  }
  void operator+=(set_hash v) {
    hs[0] = (hs[0] + v.hs[0]) % mo[0];
    hs[1] = (hs[1] * v.hs[1]) % mo[1];
    hs[2] = (hs[2] + v.hs[2]) % mo[2];
  }
};
bool operator==(set_hash a, set_hash b) {
  return ((a.hs[0] == b.hs[0]) && (a.hs[1] == b.hs[1]) && (a.hs[2] == b.hs[2]));
}
set_hash val[10][10], tot;
bool vis[10];
int res;
void bao(int pos, set_hash ha) {
  if (pos == k + 1) {
    if (ha == tot) res++;
    return;
  }
  set_hash nx;
  for (int i = 0; i < pos; i++) {
    nx = ha + val[pos][i];
    bao(pos + 1, nx);
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n >> m >> k;
  while (m--) {
    cin >> eu >> ev >> ew;
    ga[eu].push_back(make_pair(ew, ev));
  }
  for (int i = 1; i <= n; i++) sort(ga[i].begin(), ga[i].end());
  for (int i = 1; i <= n; i++)
    for (int j = 0; j < ga[i].size(); j++)
      val[ga[i].size()][j] += ga[i][j].second;
  for (int i = 1; i <= n; i++) tot += i;
  bao(1, set_hash());
  cout << res << endl;
  return 0;
}
