import times, strutils, sequtils, math, algorithm, tables, sets, lists, intsets
import critbits, future, strformat, deques
template `max=`(x,y) = x = max(x,y)
template `min=`(x,y) = x = min(x,y)
template `mod=`(x,y) = x = x mod y
template scan2 = (scan(), scan())
template scan3 = (scan(), scan())
let read* = iterator: string {.closure.} =
    while true: (for s in stdin.readLine.split: yield s)
proc scan(): int = read().parseInt
proc scanf(): float = read().parseFloat
proc toInt(c:char): int =
    return int(c) - int('0')

proc solve()=
  var
    nmax=300
    md = 10^9+7
    n = scan()
    m = scan()
    k = scan()
    es = newseqwith(nmax,newseq[int]())
    cs = newseqwith(nmax,newseq[int]())
    dp = newseqwith(n,newseqwith(nmax,newseqwith(k+1,0)))
  for i in 0..<m:
    var
      a = scan()-1
      b = scan()-1
      c = scan()
    es[a].add(b)
    cs[a].add(c)
  for j in 0..<nmax:
    dp[0][j][0]=1
  for i in 0..<n-1:
    for j in 0..<nmax:
      for l in 0..k:
        for nIdx in 0..<es[j].len:
          var
            nxt = es[j][nIdx]
            complex = cs[j][nIdx]
          if complex+l<=k:
            dp[i+1][nxt][complex+l]+=dp[i][j][l]
            dp[i+1][nxt][complex+l].mod=md
  var
    res = 0
  for j in 0..<nmax:
    res+=dp[n-1][j][k]
    res.mod=md
  echo res




solve()