#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; template struct modint { private: unsigned int value; static constexpr int mod() {return m;} public: constexpr modint(const long long x = 0) noexcept { long long y = x; if(y < 0 || y >= mod()) { y %= mod(); if(y < 0) y += mod(); } value = (unsigned int)y; } constexpr unsigned int val() noexcept {return value;} constexpr modint &operator+=(const modint &other) noexcept { value += other.value; if(value >= mod()) value -= mod(); return *this; } constexpr modint &operator-=(const modint &other) noexcept { unsigned int x = value; if(x < other.value) x += mod(); x -= other.value; value = x; return *this; } constexpr modint &operator*=(const modint &other) noexcept { unsigned long long x = value; x *= other.value; value = (unsigned int) (x % mod()); return *this; } constexpr modint &operator/=(const modint &other) noexcept { return *this *= other.inverse(); } constexpr modint inverse() const noexcept { assert(value); long long a = value,b = mod(),x = 1,y = 0; while(b) { long long q = a/b; a -= q*b; swap(a,b); x -= q*y; swap(x,y); } return modint(x); } constexpr modint power(long long N) const noexcept { assert(N >= 0); modint p = *this,ret = 1; while(N) { if(N & 1) ret *= p; p *= p; N >>= 1; } return ret; } constexpr modint operator+() {return *this;} constexpr modint operator-() {return modint() - *this;} constexpr modint &operator++(int) noexcept {return *this += 1;} constexpr modint &operator--(int) noexcept {return *this -= 1;} friend modint operator+(const modint& lhs, const modint& rhs) {return modint(lhs) += rhs;} friend modint operator-(const modint& lhs, const modint& rhs) {return modint(lhs) -= rhs;} friend modint operator*(const modint& lhs, const modint& rhs) {return modint(lhs) *= rhs;} friend modint operator/(const modint& lhs, const modint& rhs) {return modint(lhs) /= rhs;} friend ostream &operator<<(ostream &os,const modint &x) {return os << x.value;} }; //using mint = modint<998244353>; using mint = modint<1000000007>; int N,M,K; vector> G[301]; mint dp[2][301][301]; void solve() { cin >> N >> M >> K; for(int i = 0;i < M;i++) { int P,Q,C; cin >> P >> Q >> C; P--; Q--; G[P].push_back(make_pair(Q,C)); } for(int i = 0;i < 300;i++) G[300].push_back(make_pair(i,0)); int cur = 0; dp[cur][300][0] = 1; for(int i = 0;i < N;i++) { int nxt = 1-cur; for(int j = 0;j < 300;j++)for(int k = 0;k <= K;k++) dp[nxt][j][k] = 0; for(int j = 0;j <= 300 - (i ? 1:0);j++)for(int k = 0;k <= K;k++) { for(auto [nj,C]:G[j]) if(k+C <= K) dp[nxt][nj][k+C] += dp[cur][j][k]; } cur = nxt; } mint ans = 0; for(int i = 0;i < 300;i++) ans += dp[cur][i][K]; cout << ans << endl; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int tt = 1; //cin >> tt; while(tt--) solve(); }