n, m, k = map(int, input().split())
types = 300
info = [list(map(int, input().split())) for i in range(m)]
MOD = 10 ** 9 + 7

# i番目のコード進行で、
# 最後に使ったコードがjのときに
# 複雑度がkになるときの通り数
dp = [[[0] * (k + 1) for i in range(types)] for i in range(n + 1)]

for j in range(types):
    dp[0][j][0] = 1

for i in range(n):
    for p, q, c in info:
        p -= 1
        q -= 1
        for ki in range(k + 1):
            if c + ki <= k:
                dp[i + 1][q][c + ki] += dp[i][p][ki]
                dp[i + 1][q][c + ki] %= MOD
ans = 0
for j in range(types):
    ans += dp[n - 1][j][k]
    ans %= MOD
print(ans)