#include <bits/stdc++.h>
using namespace std;
template <class T, class V>
ostream &operator<<(ostream &s, pair<T, V> a) {
  s << a.first << ' ' << a.second;
  return s;
}
int invalid[10][10];
int invalid2[10][10][10][10];
vector<pair<long long int, long long int> > adj[200005];
set<pair<long long int, long long int> > inp[200005];
long long int ans = 0;
int n, m, k;
void solve(vector<long long int> &temp, int depth) {
  if (depth == k) {
    bool ok = true;
    for (int i = 0; ok && i < k; i++) {
      if (invalid[i + 1][temp[i]]) ok = false;
      for (int j = i + 1; j < k && ok; j++) {
        if (invalid2[i + 1][temp[i]][j + 1][temp[j]]) ok = false;
      }
    }
    if (ok) ans++;
    return;
  }
  for (int i = 0; i <= depth; i++) {
    temp.push_back(i);
    solve(temp, depth + 1);
    temp.pop_back();
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  int T = 1;
  for (int qq = 1; qq <= T; qq++) {
    cin >> n >> m >> k;
    for (int i = 0; i < m; i++) {
      int u, v, w;
      cin >> u >> v >> w;
      adj[u].push_back(pair<long long int, long long int>(w, v));
    }
    for (int i = 1; i <= n; i++) sort(adj[i].begin(), adj[i].end());
    for (int i = 1; i <= n; i++) {
      for (int j = 0; j < adj[i].size(); j++) {
        if (!inp[adj[i][j].second]
                 .insert(pair<long long int, long long int>(adj[i].size(), j))
                 .second)
          invalid[adj[i].size()][j] = 1;
      }
    }
    for (int i = 1; i <= n; i++) {
      for (auto x : inp[i]) {
        for (auto y : inp[i]) {
          invalid2[x.first][x.second][y.first][y.second] = 1;
          invalid2[y.first][y.second][x.first][x.second] = 1;
        }
      }
    }
    vector<long long int> t;
    solve(t, 0);
    cout << ans << endl;
  }
}
