#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
//using mint = static_modint<998244353>;
//using mint = modint;
using mint = static_modint<1000000007>;
using vm = vector<mint>;
using vvm = vector<vm>;
using vvvm = vector<vvm>;
ostream &operator<<(ostream &o,const mint &m){cout<<m.val();return o;}
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using pl = pair<ll,ll>;
#define rep(i,n) for(ll i=0;i<(ll)(n);++i)
#define reps(i,s,n) for(ll i=(s);i<(ll)(n);++i)
#define rep1(i,n) for(ll i=1;i<=(ll)(n);++i)
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
const long long INF = 1e18;

#ifdef DEBUG
#include <debug.hpp>
#endif

int main(){
#ifdef DEBUG
	cout << "--- Input ---" << endl;
#endif
	ll N,M,K;cin>>N>>M>>K;
	vector<vector<pl>> E(301);
	rep(i,M){
		ll a,b,c;cin>>a>>b>>c;
		//E.at(a).at(i)=make_pair(b,c);
		E.at(a).push_back({b,c});
	}
	reps(i,1,301)E.at(0).push_back({i,0});
#ifdef DEBUG
	cout << "--- Logic ---" << endl;
#endif
	vvvm dp(N+1,vvm(602,vm(301)));
	dp.at(0).at(0).at(0)=1;
	rep(i,N)rep(k,K+1)rep(lst,301){
		for(auto &p:E.at(lst)){
			assert(i+1>=0&&i+1<dp.size());
			assert(k+p.second>=0&&k+p.second<dp.at(i+1).size());
			assert(p.first>=0&&p.first<dp.at(i+1).at(k+p.second).size());
			dp.at(i+1).at(k+p.second).at(p.first)
				+=dp.at(i).at(k).at(lst);
		}
	}
#ifdef DEBUG
	//cout<<dp;
	cout << "--- Answer ---" << endl;
#endif
	mint ans=0;
	reps(lst,1,301)ans+=dp.at(N).at(K).at(lst);
	cout<<ans<<endl;

	return 0;
}
//cout << fixed << setprecision(9);