#include <bits/stdc++.h>
using namespace std;
void yes() {
  cout << "YES"
       << "\n";
}
void no() {
  cout << "NO"
       << "\n";
}
int dx[] = {1, 0, -1, 0, -1, -1, 1, 1};
int dy[] = {0, 1, 0, -1, -1, 1, -1, 1};
const long long INF = 8e18 + 8;
const double EPS = 1e-9;
const long long MOD = 1e9 + 7;
vector<pair<int, int> > g[200010];
vector<pair<int, int> > in[200010];
set<int> s[10][10];
bool bad[10][10][10][10];
int k;
int ans = 0;
vector<int> v;
void rec(int pos) {
  if (pos == k) {
    for (int i = 0; i < k; i++) {
      for (int j = i + 1; j < k; j++) {
        if (bad[i + 1][v[i]][j + 1][v[j]]) return;
      }
    }
    ans++;
    return;
  }
  for (int i = 1; i <= pos + 1; i++) {
    if (bad[pos + 1][i][pos + 1][i]) continue;
    v.push_back(i);
    rec(pos + 1);
    v.pop_back();
  }
}
void solve() {
  int n, m;
  cin >> n >> m >> k;
  for (int i = 0; i < m; i++) {
    int u, v, w;
    cin >> u >> v >> w;
    g[u].push_back(make_pair(w, v));
  }
  for (int i = 1; i <= n; i++) {
    sort((g[i]).begin(), (g[i]).end());
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j < (int)((g[i]).size()); j++) {
      int w = g[i][j].first;
      int to = g[i][j].second;
      if (s[(int)((g[i]).size())][j + 1].count(to)) {
        bad[(int)((g[i]).size())][j + 1][(int)((g[i]).size())][j + 1] = true;
      } else {
        s[(int)((g[i]).size())][j + 1].insert(to);
        in[to].push_back(make_pair((int)((g[i]).size()), j + 1));
      }
    }
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 0; j < (int)((in[i]).size()); j++) {
      int T = in[i][j].first;
      int t = in[i][j].second;
      for (int q = j + 1; q < (int)((in[i]).size()); q++) {
        int D = in[i][q].first;
        int d = in[i][q].second;
        bad[T][t][D][d] = true;
        bad[D][d][T][t] = true;
      }
    }
  }
  rec(0);
  cout << ans << "\n";
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  bool tests = 0;
  int t = 1;
  if (tests) cin >> t;
  for (int i = 1; i <= t; i++) {
    solve();
  }
  return 0;
}
