#include <bits/stdc++.h>
#include <iostream>
#include <limits>
#include <numeric>
#include <type_traits>
#include <bitset>
#include <list>

using namespace std;

#define rep(i,n,m) for(ll (i)=(n);(i)<(m);(i)++)
#define rrep(i,n,m) for(ll (i)=(n);(i)>(m);(i)--)
using ll = long long;
const ll mod = 1000000007;

ll dfs(ll v,ll k,ll n,vector<vector<vector<ll>>>& lis,vector<vector<vector<ll>>>& vis){

    if (k == 0 && n == 0){
        return 1;
    }else if (k < 0 or n <= 0){
        return 0;
    }else if (vis[v][k][n] != -1){
        return vis[v][k][n];
    }

    ll ret = 0 , nex , cost;
    rep(i,0,lis[v].size()){
        nex = lis[v][i][0];
        cost = lis[v][i][1];
        ret += dfs(nex , k-cost , n-1 , lis,vis);
        ret %= mod;
    }

    vis[v][k][n] = ret;
    return ret;
}

int main(){

    ll N,M,K;
    cin >> N >> M >> K;

    vector<vector<vector<ll>>> lis(300,vector<vector<ll>> (0));
    vector<vector<vector<ll>>> vis(300,vector<vector<ll>> (K+1 , vector<ll> (N,-1)));

    ll P,Q,C;
    rep(i,0,M){
        cin >> P >> Q >> C;
        P--;
        Q--;
        lis[P].push_back({Q,C});
    }

    ll ans = 0;
    rep(i,0,300){
        ans += dfs(i,K,N-1,lis,vis);
        ans %= mod;
    }

    cout << ans << endl;
}