//#include <tourist>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1}, Dy[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
#define yes cout << "Yes" << endl
#define YES cout << "YES" << endl
#define no cout << "No" << endl
#define NO cout << "NO" << endl
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define debug(v)          \
    cout << #v << ":";    \
    for (auto x : v)      \
    {                     \
        cout << x << ' '; \
    }                     \
    cout << endl;
template <class T>
bool chmax(T &a, const T &b)
{
    if (a < b)
    {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T &a, const T &b)
{
    if (b < a)
    {
        a = b;
        return 1;
    }
    return 0;
}
//cout<<fixed<<setprecision(15);有効数字15桁
//-std=c++14
//-std=gnu++17
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll n, m, k;
    cin >> n >> m >> k;
    vector<vector<pair<ll, ll>>> v(300);
    rep(i, m)
    {
        ll p, q, c;
        cin >> p >> q >> c;
        p--;
        q--;
        v[p].push_back(make_pair(q, c));
    }
    vector<vector<vector<ll>>> dp(n, vector<vector<ll>>(300, vector<ll>(k + 1, -1)));
    rep(i, 300)
    {
        dp[0][i][0] = 1;
    }
    rep(i, n-1)
    {
        rep(j, 300)
        {
            rep(l, k + 1)
            {
                if (dp[i][j][l] == -1)
                    continue;
                rep(h, v[j].size())
                {
                    if (l + v[j][h].second > k)
                        continue;
                    if (dp[i + 1][v[j][h].first][l + v[j][h].second] == -1)
                    {
                        dp[i + 1][v[j][h].first][l + v[j][h].second] = 0;
                    }
                    dp[i + 1][v[j][h].first][l + v[j][h].second] += dp[i][j][l];
                    dp[i + 1][v[j][h].first][l + v[j][h].second] %= MOD;
                }
            }
        }
    }
    ll ans = 0;
    rep(i, 300)
    {
        if (dp[n-1][i][k] != -1)
        {
            ans += dp[n-1][i][k];
            ans %= MOD;
        }
    }
    cout << ans << "\n";
}