MOD = 10**9 + 7

def main():
    import sys
    input = sys.stdin.read().split()
    idx = 0
    N = int(input[idx]); idx +=1
    M = int(input[idx]); idx +=1
    K = int(input[idx]); idx +=1
    
    edges = [[] for _ in range(301)]
    for _ in range(M):
        p = int(input[idx]); idx +=1
        q = int(input[idx]); idx +=1
        c = int(input[idx]); idx +=1
        edges[p].append( (q, c) )
    
    # DP initialization: prev[j][k] = count for position 1, j with cost k (which is 0)
    prev = [[0]*(K+1) for _ in range(301)]
    for j in range(1, 301):
        prev[j][0] = 1
    
    for _ in range(N-1):  # N-1 transitions needed
        curr = [[0]*(K+1) for _ in range(301)]
        for j in range(1, 301):
            for k in range(K+1):
                if prev[j][k] == 0:
                    continue
                for (q, c) in edges[j]:
                    new_k = k + c
                    if new_k > K:
                        continue
                    curr[q][new_k] = (curr[q][new_k] + prev[j][k]) % MOD
        prev = curr
    
    total = 0
    for j in range(1, 301):
        total = (total + prev[j][K]) % MOD
    print(total % MOD)

if __name__ == '__main__':
    main()