struct ModInt @@MOD = 1_000_000_007i64 def self.mod @@MOD end def self.zero ModInt.new(0) end def initialize(n) @n = n.to_i64 % @@MOD end getter n : Int64 def + : self self end def - : self ModInt.new(n != 0 ? @@MOD - @n : 0) end def +(m) ModInt.new(@n + m.to_i64 % @@MOD) end def -(m) ModInt.new(@n - m.to_i64 % @@MOD) end def *(m) ModInt.new(@n * m.to_i64 % @@MOD) end def /(m) raise DivisionByZeroError.new if m == 0 a, b, u, v = m.to_i64, @@MOD, 1i64, 0i64 while b != 0 t = a // b a -= t * b a, b = b, a u -= t * v u, v = v, u end ModInt.new(@n * u) end def //(m) self / m end def **(m) t, res = self, ModInt.new(1) while m > 0 res *= t if m.odd? t *= t m >>= 1 end res end def ==(m) @n == m.to_i64 end def !=(m) @n != m.to_i64 end def succ self + 1 end def pred self - 1 end def to_i64 : Int64 @n end delegate to_s, to: @n delegate inspect, to: @n end n, m, k = read_line.split.map &.to_i MAX_CODE = 300 code = Array.new(MAX_CODE) { [] of Tuple(Int32, Int32) } m.times do p, q, c = read_line.split.map &.to_i code[p - 1] << {q - 1, c} end dp = (1..MAX_CODE).map { [ModInt.new(1)] + [ModInt.zero] * k } n.pred.times do dp2 = (0...MAX_CODE).map { [ModInt.zero] * (k + 1) } ii = (0...MAX_CODE).to_a jj = (0..k).to_a ii.product(jj) do |from, sum| code[from].each do |to, cost| dp2[to][sum + cost] += dp[from][sum] if sum + cost <= k end end dp = dp2 end puts dp.sum(&.[k])