// #pragma GCC target("avx2") // #pragma GCC optimize("O3") // #pragma GCC optimize("unroll-loops") #include using namespace std; using ll = long long; using ld = long double; using pll = pair; using pii = pair; using vvl = vector>; using vvi = vector>; using vvpll = vector>; #define rep(i, a, b) for (ll i=(a); i<(b); i++) #define rrep(i, a, b) for (ll i=(a); i>(b); i--) #define pb push_back #define tostr to_string #define list2d(name, N, M, type, init) vector> name(N, vector(M, init)) #define list3d(name, N, M, L, type, init) vector>> name(N, vector>(M, vector(L, init))) constexpr ll INF = LONG_LONG_MAX; constexpr ll MOD = 1000000007; void print(ld out) { cout << fixed << setprecision(15) << out << '\n'; } void print(double out) { cout << fixed << setprecision(15) << out << '\n'; } template void print(T out) { cout << out << '\n'; } template void print(pair out) { cout << out.first << ' ' << out.second << '\n'; } template void print(vector A) { rep(i, 0, A.size()) { cout << A[i]; cout << (i == A.size()-1 ? '\n' : ' '); } } template void print(set S) { vector A(S.begin(), S.end()); print(A); } template inline bool chmax(T &x, T y) { return (y > x) ? x = y, true : false; } template inline bool chmin(T &x, T y) { return (y < x) ? x = y, true : false; } ll sum(vector A) { ll res = 0; for (ll a: A) res += a; return res; } ll max(vector A) { ll res = -INF; for (ll a: A) chmax(res, a); return res; } ll min(vector A) { ll res = INF; for (ll a: A) chmin(res, a); return res; } ll toint(string s) { ll res = 0; for (char c : s) { res *= 10; res += (c - '0'); } return res; } int toint(char num) { return num - '0'; } char tochar(int num) { return '0' + num; } inline ll pow(int x, ll n) { ll res = 1; rep(_, 0, n) res *= x; return res; } inline ll pow(ll x, ll n, int mod) { ll res = 1; while (n > 0) { if (n & 1) { res = (res * x) % mod; } x = (x * x) % mod; n >>= 1; } return res; } inline ll floor(ll a, ll b) { if (a < 0) { return (a-b+1) / b; } else { return a / b; } } inline ll ceil(ll a, ll b) { if (a >= 0) { return (a+b-1) / b; } else { return a / b; } } pll divmod(ll a, ll b) { ll d = a / b; ll m = a % b; return {d, m}; } int popcount(ll S) { return __builtin_popcountll(S); } ll gcd(ll a, ll b) { return __gcd(a, b); } int main() { cin.tie(0); ios::sync_with_stdio(false); ll N, M, K; cin >> N >> M >> K; ll L = 300; vvpll nodes(L); rep(i, 0, M){ ll u, v, c; cin >> u >> v >> c; u--; v--; nodes[u].pb({v, c}); } list3d(dp, N+1, L, K+1, ll, 0); rep(u, 0, L) { dp[1][u][0] = 1; } rep(i, 1, N) { rep(u, 0, L) { rep(k, 0, K+1) { if (!dp[i][u][k]) continue; for (auto &[v, c] : nodes[u]) { if (k+c <= K) { dp[i+1][v][k+c] += dp[i][u][k]; dp[i+1][v][k+c] %= MOD; } } } } } ll ans = 0; rep(u, 0, L) { ans += dp[N][u][K]; ans %= MOD; } print(ans); return 0; }