#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;

int main() {
    int N, M, K;
    cin >> N >> M >> K;
    vector<int> P(M), Q(M), C(M);
    rep(i, M) {
        P[i]--;
        Q[i]--;
        cin >> P[i] >> Q[i] >> C[i];
    }

    map<int, vector<pair<int, int>>> G;
    rep(i, M) {
        G[P[i]].push_back(make_pair(Q[i], C[i]));
    }

    const int MAX = 305;
    // const int MAX = 10;
    const int MOD = 1000000007;

    vector<vector<vector<int>>> dp(MAX, vector<vector<int>>(MAX, vector<int>(MAX)));
    for (int i = 0; i < M; i++) {
        dp[1][Q[i]][C[i]]++;
    }

    // コード数
    for (int i = 1; i < N; i++) {
        for (int j = 0; j < MAX; j++) {
            // 複雑さ
            for (int s = 0; s <= K; s++) {

                for (int k = 0; k < G[j].size(); k++) {
                    int nj = G[j][k].first;
                    int nc = G[j][k].second;

                    if (s + nc > K) continue;

                    dp[i + 1][nj][s + nc] += dp[i][j][s];
                    dp[i + 1][nj][s + nc] %= MOD;
                }
            }
        }
    }

    int ans = 0;
    for (int x = 0; x < MAX; x++) {
        ans += dp[N - 1][x][K];
        ans %= MOD;
    }

    cout << ans << endl;
}