#include <bits/stdc++.h>
using namespace std;

int main() {
    const long mod = 1000000007;
    int n, m, k;
    cin >> n >> m >> k;
    assert(2 <= n && n <= 100);
    assert(1 <= m && m <= 100);
    assert(0 <= k && k <= 100);
    vector<int> p(m), q(m), c(m);
    vector<pair<int, int>> check;
    for (int i = 0; i < m; i++) {
        cin >> p.at(i) >> q.at(i) >> c.at(i);
        assert(1 <= p.at(i) && p.at(i) <= 100);
        assert(1 <= q.at(i) && q.at(i) <= 100);
        assert(p.at(i) != q.at(i));
        assert(0 <= c.at(i) && c.at(i) <= 100);
        check.emplace_back(p.at(i), q.at(i));
    }
    sort(check.begin(), check.end());
    for (int i = 0; i < m - 1; i++) {
        assert(check.at(i) != check.at(i + 1));
    }
    for (int i = 0; i < m; i++) {
        p.at(i)--; q.at(i)--;
    }
    long dp[n - 1][100][k + 1] = { };
    for (int i = 0; i < m; i++) {
        if (c.at(i) <= k) dp[0][q.at(i)][c.at(i)]++;
    }
    for (int i = 1; i < n - 1; i++) {
        for (int j = 0; j < m; j++) {
            for (int comp = c.at(j); comp <= k; comp++) {
                dp[i][q.at(j)][comp] += dp[i - 1][p.at(j)][comp - c.at(j)];
                dp[i][q.at(j)][comp] %= mod;
            }
        }
    }
    long ans = 0;
    for (int i = 0; i < 100; i++) {
        ans += dp[n - 2][i][k];
        ans %= mod;
    }
    cout << ans << endl;
}