#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for(int i=0;i<n;++i)
#define rrep(i, n) for(int i=n;i>=0;--i)
const int inf=1e9+7;
const ll mod=1e9+7;
const ll big=1e18;
const double PI=2*asin(1);

ll DP[305][305][305];

int main() {
  int N, M, K;
  cin>>N>>M>>K;
  vector<vector<pair<int, int> > > edge(305);
  ll P, Q, C;
  map<int, int> amap;
  for(int i=0;i<M;++i) {
    cin>>P>>Q>>C;
    P--;
    Q--;
    edge[P].push_back(mp(Q, C));
  }
  for(int i=0;i<305;++i){
    DP[0][0][i] = 1;
  }
  for(int i=0;i<N;++i){
    for(int j=0;j<=K;++j){
      for(int k=0;k<305;++k){
        for(int l=0;l<edge[k].size();++l){
          if(j+edge[k][l].se>K) continue;
          DP[i+1][j+edge[k][l].se][edge[k][l].fi] += DP[i][j][k];
          DP[i+1][j+edge[k][l].se][edge[k][l].fi] %= mod;
        }
      }
    }
  }
  ll ans = 0;
  for(int k=0;k<305;++k) {
    ans += DP[N-1][K][k];
    ans %= mod;
  }
  cout<<ans<<endl;
}