#include <bits/stdc++.h>
#pragma comment(linker, "/stack:512000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,tune=native")
#pragma GCC optimize("unroll-loops")
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
mt19937_64 gen(time(nullptr));
struct custom_hash {
  static uint64_t splitmix64(uint64_t x) {
    x += 0x9e3779b97f4a7c15;
    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
    return x ^ (x >> 31);
  }
  size_t operator()(uint64_t x) const {
    static const uint64_t FIXED_RANDOM =
        chrono::steady_clock::now().time_since_epoch().count();
    return splitmix64(x + FIXED_RANDOM);
  }
};
ll mod = 1e9 + 7;
namespace {
ll mul(ll a, ll b) {
  ll val = a * b - (ll)((ld)a * b / mod) * mod;
  if (val < 0) val += mod;
  if (val >= mod) val -= mod;
  return val;
}
ll poww(ll a, ll b) {
  ll val = 1;
  a %= mod;
  while (b > 0) {
    if (b % 2) val = mul(a, val);
    a = mul(a, a);
    b >>= 1;
  }
  return val % mod;
}
ll inv(ll a) { return poww(a, mod - 2); }
}  // namespace
ll const maxn = 3e5 + 5;
struct edge {
  ll to, w;
};
vector<edge> g[maxn], gg[maxn];
ll type[maxn];
vector<ll> rofl[maxn];
bool f[10][10][10][10];
ll k, ans = 0;
vector<ll> kek;
void dfs(ll i, ll j) {
  kek.push_back(j);
  if (i == k - 1) {
    bool good = true;
    for (ll ii = 0; ii < k; ii++) {
      if (!good) break;
      for (ll jj = ii; jj < k; jj++) {
        if (f[ii][kek[ii]][jj][kek[jj]]) {
          good = false;
          break;
        }
      }
    }
    if (good) {
      ans++;
    }
  } else {
    for (ll jj = 0; jj <= i + 1; jj++) {
      dfs(i + 1, jj);
    }
  }
  kek.pop_back();
}
void ggg() {
  cout << 0 << endl;
  exit(0);
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ll n, m;
  cin >> n >> m >> k;
  for (ll i = 0; i < m; i++) {
    ll u, v, w;
    cin >> u >> v >> w;
    g[u].push_back({v, w});
    rofl[u].push_back(w);
  }
  for (ll i = 1; i <= n; i++) {
    type[i] = (ll)g[i].size() - 1;
    for (auto& e : g[i]) {
      e = {e.to,
           lower_bound(rofl[i].begin(), rofl[i].end(), e.w) - begin(rofl[i])};
    }
    for (auto e : g[i]) {
      ll v = e.to;
      gg[v].push_back({i, e.w});
    }
  }
  for (ll v = 1; v <= n; v++) {
    for (auto& e : gg[v]) {
      e = {type[e.to], e.w};
    }
    set<pair<ll, ll>> st;
    for (auto e : gg[v]) {
      if (st.count({e.to, e.w})) {
        f[e.to][e.w][e.to][e.w] = 1;
      }
      st.insert({e.to, e.w});
    }
    vector<edge> tmp;
    for (auto e : st) {
      tmp.push_back({e.first, e.second});
    }
    gg[v] = tmp;
    for (ll i = 0; i < gg[v].size(); i++) {
      for (ll j = i + 1; j < gg[v].size(); j++) {
        f[gg[v][i].to][gg[v][i].w][gg[v][j].to][gg[v][j].w] = 1;
        f[gg[v][j].to][gg[v][j].w][gg[v][i].to][gg[v][i].w] = 1;
      }
    }
  }
  dfs(0, 0);
  cout << ans << endl;
  return 0;
}
