import sys

sys.setrecursionlimit(10 ** 6)

def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def SI(): return sys.stdin.readline()[:-1]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
int1 = lambda x: int(x) - 1
def MI1(): return map(int1, sys.stdin.readline().split())
def LI1(): return list(map(int1, sys.stdin.readline().split()))
p2D = lambda x: print(*x, sep="\n")
dij = [(1, 0), (0, 1), (-1, 0), (0, -1)]

def main():
    # dp[i][s][u]
    dp = [[[0] * 300 for _ in range(k + 1)] for _ in range(n)]
    for i in range(300): dp[0][0][i] = 1

    for i in range(n - 1):
        for s in range(k + 1):
            for u in range(300):
                pre = dp[i][s][u] % md
                if pre == 0: continue
                for v, c in to[u]:
                    ns = s + c
                    if ns > k: continue
                    dp[i + 1][ns][v] += pre
    print(sum(dp[n - 1][k]) % md)

md=10**9+7
n,m,k=MI()
to=[[] for _ in range(300)]
for _ in range(m):
    u,v,c=MI1()
    to[u].append((v,c+1))
main()