import sys
sys.setrecursionlimit(10**6)
input = sys.stdin.buffer.readline

n, m, k = map(int, input().split())
g = [[] for i in range(300)]
for i in range(m):
    p, q, c = map(int, input().split())
    p, q = p-1, q-1
    g[p].append((q, c))

ans = 0
def dfs(A):
    global ans
    if len(A) == n:
        s = A[-1][1]
        if s == k:
            ans += 1
        return
    p, s = A[-1]
    for q, c in g[p]:
        A.append((q, s+c))
        dfs(A)
        A.pop()

for i in range(300):
    dfs([(i, 0)])
print(ans)