def mat_mul(A, B, MOD=None):
    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]
                if MOD!=None:
                    C[i][j] %= MOD
    return C

def mat_pow(A, n, MOD=None):
    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, MOD)
        n >>= 1
        A = mat_mul(A, A, MOD)
    return res

k,m,n = map(int, input().split())
mod = 10**9+7
A = [[0]*(k**2) for _ in range(k**2)]

for _ in range(m):
    p,q,r = map(int, input().split())
    s = (p-1)*k+q-1
    t = (q-1)*k+r-1
    A[s][t] = 1

res = mat_pow(A, n-2, mod)
ans = 0

for i in range(k):
    for j in range(k):
        ans+=res[i][j*k]
        ans%=mod

print(ans)