#include <bits/stdc++.h>
using namespace std;
const int nax = 2e5 + 5;
vector<pair<int, int> > adj[nax];
vector<int> inc[nax];
int n, m, k;
int cnt[11];
vector<vector<int> > base;
bool cmp(pair<int, int> x, pair<int, int> y) { return x.second < y.second; }
bool ok[11][11][11][11];
int have[11][11];
long long int go[11][11];
long long int fast[nax];
const int mod = 1e9 + 9;
void rec(int dep, int akt, vector<int> p) {
  p.push_back(akt);
  if (dep == k) {
    base.push_back(p);
    return;
  }
  for (int i = 1; i <= dep + 1; i++) {
    rec(dep + 1, i, p);
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> m >> k;
  fast[0] = 1;
  for (int i = 1; i < nax; i++) {
    fast[i] = fast[i - 1] * 67;
    fast[i] %= mod;
  }
  for (int i = 1; i <= m; i++) {
    int x, y;
    cin >> x >> y;
    int w;
    cin >> w;
    adj[x].push_back(make_pair(y, w));
    inc[y].push_back(x);
  }
  for (int i = 1; i <= n; i++) sort(adj[i].begin(), adj[i].end(), cmp);
  for (int i = 1; i <= n; i++) {
    vector<pair<int, int> > akt;
    for (int s : inc[i]) {
      for (int j = 0; j < adj[s].size(); j++) {
        if (adj[s][j].first == i) {
          akt.push_back(make_pair(adj[s].size(), j + 1));
        }
      }
    }
    int c = akt.size();
    for (int a = 1; a <= c; a++) {
      pair<int, int> v = akt[a - 1];
      go[v.first][v.second] += fast[i];
    }
  }
  long long int w = 0;
  for (int i = 1; i <= n; i++) {
    w += fast[i];
    w %= mod;
  }
  int ans = 0;
  vector<int> e = {};
  rec(1, 1, e);
  for (auto s : base) {
    vector<int> akt = s;
    long long int sum = 0;
    for (int i = 1; i <= k; i++) {
      sum += go[i][akt[i - 1]];
      sum %= mod;
    }
    if (sum == w) ans++;
  }
  cout << ans;
  return 0;
}
