#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))

using namespace std;

template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}

const ll mod=1e9+7;

int main() {
    ll n,m,k;
    cin >> n >> m >> k;
    vector<ll> p(m),q(m),c(m);
    rep(i,m){
        cin >> p[i] >> q[i] >> c[i];
        p[i]--;
        q[i]--;
    }
    vector<vector<vector<ll>>> dp(n,vector<vector<ll>>(300,vector<ll>(500)));
    rep(i,300){
        dp[0][i][0]=1;
    }
    rep(i,n-1){
        rep(j,m){
            for(ll s=0;s<=k;s++){
                if(s-c[j]>=0){
                    dp[i+1][q[j]][s]+=dp[i][p[j]][s-c[j]];
                    dp[i+1][q[j]][s]%=mod;
                }
            }
        }
        //cout << dp[i+1][0][0] << endl;
    }
    ll ans=0;
    rep(j,300){
        ans+=dp[n-1][j][k];
        ans%=mod;
    }
    cout << ans << endl;
    return 0;
}