#include <iostream>
#include <vector>
#include <map>
using namespace std;
#define rep(i,n) for(int i=0,_i=(n);i<_i;++i)

struct Graph {
  vector<map<int, long long>> edge;
  Graph(int n = 0) { resize(n); }
  void resize(int n) {
    edge.resize(n, map<int, long long>());
  }
  void addEdge(int from, int to, long long weight) {
    edge[from][to] = weight;
  }
  map<int, long long>& operator[](int from) { return edge[from]; }
};
template<int MOD> struct MInt {
  long long val;
  constexpr MInt(long long val = 0) : val(val % MOD) { if (val < 0) val += MOD; }
  constexpr MInt operator+(const MInt& n) const { return MInt(val) += n; }
  constexpr MInt& operator+=(const MInt& n) { val = (val + n.val) % MOD; return *this; }
  constexpr friend ostream& operator<<(ostream& os, const MInt& n) { os<<n.val; return os; }
};
using mint = MInt<1000000007>;

int main() {
  int N, M, K;
  cin >> N >> M >> K;

  Graph G(300);
  rep(i, M) {
    int P, Q, C;
    cin >> P >> Q >> C;
    --P, --Q;
    G.addEdge(P, Q, C);
  }
  mint memo[300][K+1];

  rep(i, 300) {
    memo[i][0] = 1;
  }
  rep(n, N-1) {
    mint memo2[300][K+1];
    rep(from, 300) rep(k, K+1)
      for (const auto& [to, c] : G[from]) {
        if (k-c >= 0)
          memo2[from][k] += memo[to][k-c];
      }
    rep(from, 300) rep(k, K+1)
      memo[from][k] = memo2[from][k];
  }

  mint ans = 0;
  rep(from, 300)
    ans += memo[from][K];

  cout << ans << endl;

  return 0;
}