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

ll dp[305][305][305];
const int mod=1e9+7;

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