import sys
input = sys.stdin.readline
from collections import *

def mat_mul(A, B):
    C = [[0]*len(B[0]) for _ in range(len(A))]
    
    for i in range(len(A)):
        for j in range(len(B[0])):
            for k in range(len(A[0])):
                C[i][j] += A[i][k]*B[k][j]
                C[i][j] %= MOD
    
    return C

def mat_pow(A, n):
    res = [[0]*len(A) for _ in range(len(A))]
    
    for i in range(len(A)):
        res[i][i] = 1
    
    while n>0:
        if n&1:
            res = mat_mul(res, A)
        
        n >>= 1
        A = mat_mul(A, A)
    
    return res

K, M, N = map(int, input().split())
MOD = 10**9+7

if N==3:
    ans = 0
    
    for _ in range(M):
        P, Q, R = map(int, input().split())
        
        if P==1 and R==1:
            ans += 1
    
    print(ans)
    exit()
    
serial = [[[-1]*K for _ in range(K)] for _ in range(K)]
c = 0

for i in range(K):
    for j in range(K):
        for k in range(K):
            serial[i][j][k] = c
            c += 1

A = [[0]*c for _ in range(c)]
ok = [False]*c

for _ in range(M):
    P, Q, R = map(int, input().split())
    ok[serial[P-1][Q-1][R-1]] = True

for i in range(K):
    for j in range(K):
        for k in range(K):
            for l in range(K):
                if ok[serial[i][j][k]] and ok[serial[j][k][l]]:
                    A[serial[i][j][k]][serial[j][k][l]] = 1

res = mat_pow(A, N-3)
ans = 0

for i in range(K):
    for j in range(K):
        for k in range(K):
            for l in range(K):
                ans += res[serial[0][i][j]][serial[k][l][0]]
                ans %= MOD

print(ans)