#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v).end()
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; }
const ll INF=1LL<<60;
const int inf=(1<<30)-1;
const int mod=1e9+7;
int dx[8]={1,0,-1,0,-1,-1,1,1};
int dy[8]={0,1,0,-1,-1,1,-1,1};
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n,m,k;cin >> n >> m >> k;
    vector<int> p(m),q(m),c(m);
    vector<vector<pair<int,int>>> a(300);
    REP(i,m){
        cin >> p[i] >> q[i] >> c[i];
        p[i]--,q[i]--;
        a[p[i]].push_back({q[i],c[i]});
    }
    ll dp[n][k+1][300]={};
    REP(i,300){
        dp[0][0][i]=1;
    }
    REP(i,n-1){
        REP(j,k+1){
            REP(l,300){
                if(!dp[i][j][l]){
                    continue;
                }
                for(auto v:a[l]){
                    if(j+v.second<=k){
                        (dp[i+1][j+v.second][v.first]+=dp[i][j][l])%=mod;
                    }
                }
            }
        }
    }
    ll ans=0;
    REP(i,300){
        (ans+=dp[n-1][k][i])%=mod;
    }
    cout << ans << endl;
}