#include #include #include template struct ModInt { using lint = long long; int val; // constructor ModInt(lint v = 0) : val(v % MOD) { if (val < 0) val += MOD; }; // unary operator ModInt operator+() const { return ModInt(val); } ModInt operator-() const { return ModInt(MOD - val); } ModInt inv() const { return this->pow(MOD - 2); } // arithmetic ModInt operator+(const ModInt& x) const { return ModInt(*this) += x; } ModInt operator-(const ModInt& x) const { return ModInt(*this) -= x; } ModInt operator*(const ModInt& x) const { return ModInt(*this) *= x; } ModInt operator/(const ModInt& x) const { return ModInt(*this) /= x; } ModInt pow(lint n) const { auto x = ModInt(1); auto b = *this; while (n > 0) { if (n & 1) x *= b; n >>= 1; b *= b; } return x; } // compound assignment ModInt& operator+=(const ModInt& x) { if ((val += x.val) >= MOD) val -= MOD; return *this; } ModInt& operator-=(const ModInt& x) { if ((val -= x.val) < 0) val += MOD; return *this; } ModInt& operator*=(const ModInt& x) { val = lint(val) * x.val % MOD; return *this; } ModInt& operator/=(const ModInt& x) { return *this *= x.inv(); } // compare bool operator==(const ModInt& b) const { return val == b.val; } bool operator!=(const ModInt& b) const { return val != b.val; } bool operator<(const ModInt& b) const { return val < b.val; } bool operator<=(const ModInt& b) const { return val <= b.val; } bool operator>(const ModInt& b) const { return val > b.val; } bool operator>=(const ModInt& b) const { return val >= b.val; } // I/O friend std::istream& operator>>(std::istream& is, ModInt& x) noexcept { return is >> x.val; } friend std::ostream& operator<<(std::ostream& os, const ModInt& x) noexcept { return os << x.val; } }; constexpr int MOD = 1000000007; using mint = ModInt; template std::vector vec(int len, T elem) { return std::vector(len, elem); } constexpr int N = 300; void solve() { int n, m, k; std::cin >> n >> m >> k; --n; std::vector>> graph(N); while (m--) { int u, v, c; std::cin >> u >> v >> c; graph[--u].emplace_back(--v, c); } auto dp = vec(k + 1, vec(N, mint(0))); std::fill(dp[0].begin(), dp[0].end(), 1); auto ndp = dp; while (n--) { for (auto& v : ndp) { std::fill(v.begin(), v.end(), 0); } for (int v = 0; v < N; ++v) { for (auto [u, d] : graph[v]) { for (int c = 0; c + d <= k; ++c) { ndp[c + d][u] += dp[c][v]; } } } dp = ndp; } std::cout << std::accumulate(dp[k].begin(), dp[k].end(), mint(0)) << "\n"; } int main() { std::cin.tie(nullptr); std::ios::sync_with_stdio(false); solve(); return 0; }