// #pragma GCC target ("avx") // #pragma GCC optimize("Ofast") // #pragma GCC optimize("unroll-loops") // #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") #include using namespace std; // #define int long long // #define endl '\n' #pragma region TEMPLATE /* TYPE */ typedef long long ll; typedef long double ld; typedef pair pii; typedef pair pll; typedef vector vpii; typedef vector vpll; typedef vector vi; typedef vector vl; typedef vector vst; typedef vector vb; typedef vector vld; typedef vector> vvi; template> using prique = priority_queue, Cmp>; template using prique_r = prique>; /* CONSTANT */ #define ln '\n' const int INF = 1 << 30; const ll INFF = 1LL << 60; const string ALPHABET = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; const int MOD = 1e9 + 7; const int MODD = 998244353; const string alphabet = "abcdefghijklmnopqrstuvwxyz"; const double EPS = 1e-9; const ld PI = 3.14159265358979323846264338327950288; const int dx[] = { 1, 0, -1, 0, 1, -1, -1, 1, 0 }; const int dy[] = { 0, 1, 0, -1, -1, -1, 1, 1, 0 }; /* CONTAINER */ #define PB emplace_back #define ALL(v) (v).begin(), (v).end() #define RALL(v) (v).rbegin(), (v).rend() #define SORT(v) sort(ALL(v)) #define RSORT(v) sort(RALL(v)) #define LESS(x, val) (lower_bound(x.begin(), x.end(), val) - x.begin()) #define LEQ(x, val) (upper_bound(x.begin(), x.end(), val) - x.begin()) #define GREATER(x, val) (int)(x).size() - LEQ((x), (val)) #define GEQ(x, val) (int)(x).size() - LESS((x), (val)) #define UNIQUE(v) sort(ALL(v)); (v).erase(unique(ALL(v)), (v).end()) template vector make_v(size_t a) { return vector(a); } template auto make_v(size_t a, Ts... ts) { return vector(ts...))>(a, make_v(ts...)); } template enable_if_t::value != 0> fill_v(U &u, const V... v) { u = U(v...); } template enable_if_t::value == 0> fill_v(U &u, const V... v) { for (auto &e : u) fill_v(e, v...); } /* LOOP */ #define _overload3(_1, _2, _3, name, ...) name #define _REP(i, n) REPI(i, 0, n) #define REPI(i, a, b) for (ll i = (ll)a; i < (ll)b; ++i) #define REP(...) _overload3(__VA_ARGS__, REPI, _REP,)(__VA_ARGS__) #define _RREP(i, n) RREPI(i, n, 0) #define RREPI(i, a, b) for (ll i = (ll)a; i >= (ll)b; --i) #define RREP(...) _overload3(__VA_ARGS__, RREPI, _RREP,)(__VA_ARGS__) #define EACH(e, v) for (auto& e : v) #define PERM(v) sort(ALL(v)); for (bool c##p = true; c##p; c##p = next_permutation(ALL(v))) /* INPUT */ template void SSS(T& t) { cin >> t; } template void SSS(Head&& head, Tail&&... tail) { cin >> head; SSS(tail...); } #define SS(T, ...) T __VA_ARGS__; SSS(__VA_ARGS__); #define SV(T, v, n) vector v(n); for (auto& i : v) cin >> i; #define SVV(T, v, n, m) vector> v(n, vector(m)); for (auto& r : v) for (auto& i : r) cin >> i; /* OUTPUT */ // Yes / No inline int YES(bool x) { cout << (x ? "YES" : "NO") << endl; return 0; } inline int Yes(bool x) { cout << (x ? "Yes" : "No") << endl; return 0; } inline int yes(bool x) { cout << (x ? "yes" : "no") << endl; return 0; } inline int yES(bool x) { cout << (x ? "yES" : "nO") << endl; return 0; } inline int Yay(bool x) { cout << (x ? "Yay!" : ":(") << endl; return 0; } // PROTOTYPE DECLARATION template ostream &operator<<(ostream &os, const pair &j); template ostream &operator<<(ostream &os, const tuple &t); template::value, decltype(declval().begin(), nullptr)> = nullptr> ostream& operator<<(ostream &os, const C &c); template ostream &operator<<(ostream &os, const stack &j); template ostream &operator<<(ostream &os, const queue &j); template ostream &operator<<(ostream &os, const priority_queue &j); // IMPLEMENTATION template ostream &operator<<(ostream &os, const pair &j) { return os << '{' << j.first << ", " << j.second << '}'; } template enable_if_t PRINT_TUPLE(ostream &os, const tuple &t) {} template enable_if_t PRINT_TUPLE(ostream &os, const tuple &t) { os << get(t); if (num + 1 < sizeof...(T)) os << ", "; PRINT_TUPLE(os, t); } template ostream &operator<<(ostream &os, const tuple &t) { PRINT_TUPLE(os << '{', t); return os << '}'; } template::value, decltype(declval().begin(), nullptr)>> ostream& operator<<(ostream &os, const C &c) { os << '{'; for (auto it = begin(c); it != end(c); it++) { if (begin(c) != it) os << ", "; os << *it; } return os << '}'; } template ostream &operator<<(ostream &os, const stack &j) { deque d; for (auto c = j; !c.empty(); c.pop()) d.push_front(c.top()); return os << d; } template ostream &operator<<(ostream &os, const queue &j) { deque d; for (auto c = j; !c.empty(); c.pop()) d.push_back(c.front()); return os << d; } template ostream &operator<<(ostream &os, const priority_queue &j) { deque d; for (auto c = j; !c.empty(); c.pop()) d.push_front(c.top()); return os << d; } // OUTPUT FUNCTION template int PV(T &v) { int sz = v.size(); for (int i = 0; i < sz; ++i) cout << v[i] << " \n"[i == sz - 1]; return 0; } inline int print() { cout << endl; return 0; } template int print(Head&& head){ cout << head; return print(); } template int print(Head&& head, Tail&&... tail) { cout << head << " "; return print(forward(tail)...); } #ifdef LOCAL inline void dump() { cerr << endl; } template void dump(Head&& head) { cerr << head; dump(); } template void dump(Head&& head, Tail&&... tail) { cerr << head << ", "; dump(forward(tail)...); } #define debug(...) do {cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; dump(__VA_ARGS__); } while (false) #else #define dump(...) #define debug(...) #endif /* OTHER */ #define fi first #define se second #define MP make_pair #define MT make_tuple #define tmax(x, y, z) max((x), max((y), (z))) #define tmin(x, y, z) min((x), min((y), (z))) template inline bool between(T x, A a, B b) { return ((a <= x) && (x < b)); } template inline bool chmax(A &a, const B &b) { if (a < b) { a = b; return true; } return false; } template inline bool chmin(A &a, const B &b) { if (a > b) { a = b; return true; } return false; } inline ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; } inline ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } inline ll POW(ll a, ll b) { ll r = 1; do { if (b & 1) r *= a; a *= a; } while (b >>= 1); return r; } struct abracadabra { abracadabra() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); cerr << fixed << setprecision(5); }; } ABRACADABRA; #pragma endregion #pragma region math modint /** * @brief ModInt * @docs docs/math/modint.md */ template< int MODULO > struct ModInt { using i32 = int; using i64 = long long; using u32 = unsigned int; using u64 = unsigned long long; u64 x; ModInt() : x(0) {} ModInt(i64 y) : x(set(y % MODULO + MODULO)) {} static u64 set(const i64 &y) { return (y < MODULO) ? y : y - MODULO; } ModInt operator+(const ModInt &m) const { return ModInt(set(x + m.x)); } ModInt operator-(const ModInt &m) const { return ModInt(set(x + MODULO - m.x)); } ModInt operator*(const ModInt &m) const { return ModInt(x * m.x % MODULO); } ModInt operator/(const ModInt &m) const { return ModInt(x) * ~ModInt(m.x); } ModInt &operator+=(const ModInt &m) { return *this = *this + m; } ModInt &operator-=(const ModInt &m) { return *this = *this - m; } ModInt &operator*=(const ModInt &m) { return *this = *this * m; } ModInt &operator/=(const ModInt &m) { return *this = *this / m; } ModInt &operator^=(const u64 &y) { return *this = *this ^ y; } ModInt operator~ () const { return *this ^ (MODULO - 2); } ModInt operator- () const { return ModInt(set(MODULO - x)); } ModInt operator++() { return *this = ModInt(set(x + 1)); } ModInt operator--() { return *this = ModInt(set(x + MODULO - 1)); } bool operator==(const ModInt &m) const { return x == m.x; } bool operator!=(const ModInt &m) const { return x != m.x; } bool operator< (const ModInt &m) const { return x < m.x; } bool operator<=(const ModInt &m) const { return x <= m.x; } bool operator> (const ModInt &m) const { return x > m.x; } bool operator>=(const ModInt &m) const { return x >= m.x; } explicit operator u64() const { return x; } ModInt operator^(i64 y) const { return pow(x, y); } static ModInt pow(i64 x, i64 y) { bool neg = false; if (y < 0) y = -y, neg = true; ModInt u(1), t(x); while (y) { if (y & 1) u *= t; t *= t; y >>= 1; } return neg ? ModInt(1) / u : u; } friend ostream &operator<<(ostream &os, const ModInt< MODULO > &m) { return os << m.x; } friend istream &operator>>(istream &is, ModInt< MODULO > &m) { u64 y; is >> y; m = ModInt(y); return is; } }; constexpr int MODULO = (int)1e9 + 7; using modint = ModInt< MODULO >; #pragma endregion using mint = modint; mint dp[303][303][303]; bool done[303][303][303]; vector> nxt[303]; signed main() { dp[0][300][0] = 1; SS(int, N, M, K); REP(i, M) { SS(int, P, Q, C); --P, --Q; nxt[P].emplace_back(Q, C); } REP(i, 300) nxt[300].emplace_back(i, 0); // [complx, idx, prv] prique_r> pq; pq.emplace(0, 0, 300); while (not pq.empty()) { auto [c, i, p] = pq.top(); pq.pop(); for (auto& [q, d]: nxt[p]) { if (c + d <= K) { dp[i + 1][q][c + d] += dp[i][p][c]; if (not done[i + 1][q][c + d] and i + 1 < N) pq.emplace(c + d, i + 1, q); done[i + 1][q][c + d] = true; } } } mint res = 0; REP(i, 301) res += dp[N][i][K]; print(res); }