import sys
import io, os
input = sys.stdin.buffer.readline

mod = 10**9+7

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

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

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

A = [[0]*(k**2) for i in range(k**2)]
for i in range(m):
    p, q, r = PQR[i]
    u = p*k+q
    v = q*k+r
    A[u][v] += 1

A = mat_pow(A, n-2, mod)
ans = 0
for i in range(k):
    v = 0*k+i
    for j in range(k):
        u = j*k+0
        ans += A[v][u]
#print(A)
print(ans)