#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<int, int>;
using PL = pair<lint, lint>;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define ALL(a)  (a).begin(),(a).end()
constexpr int MOD = 1000000007;
constexpr int INF = 2147483647;
void yes(bool expr) {
  cout << (expr ? "Yes" : "No") << "\n";
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    lint N, M, K;
    cin >> N >> M >> K;
    vector<lint> P(M);
    vector<lint> Q(M);
    vector<lint> C(M);
    REP(i, M) {
        cin >> P[i] >> Q[i] >> C[i];
        P[i]--; Q[i]--;
    }
    vector<vector<vector<lint>>> dp(N, vector<vector<lint>>(300, vector<lint>(K+1)));
    REP(i, 300) dp[0][i][0] = 1;
    REP(i, N-1) REP(j, M) IREP(k, K+1) {
        if(k + C[j] <= K) dp[i+1][Q[j]][k+C[j]] = (dp[i+1][Q[j]][k+C[j]] + dp[i][P[j]][k]) % MOD;
    }
    lint ans = 0;
    REP(i, 300) ans = (ans + dp[N-1][i][K]) % MOD;
    cout << ans << endl;
}