def matmul(A,B): # A,B: 行列
    res = [[0]*len(B[0]) for _ in [None]*len(A)]
    for i, resi in enumerate(res):
        for k, aik in enumerate(A[i]):
            for j,bkj in enumerate(B[k]):
                resi[j] += aik*bkj
                resi[j] %= MOD
    return res

def matpow(A,p): #A^p mod M
    if p%2:
        return matmul(A, matpow(A,p-1))
    elif p > 0:
        b = matpow(A,p//2)
        return matmul(b,b)
    else:
        return [[int(i==j) for j in range(len(A))] for i in range(len(A))]

MOD = 10**9+7
S = 36
k,m,n = map(int,input().split())
A = [[0]*S for _ in range(S)]
for _ in range(m):
    p,q,r = map(int,input().split())
    A[(p-1)*6+q-1][(q-1)*6+r-1] += 1

v = [0]*S
v[:6] = [1]*6
v = matmul([v],matpow(A,n-2))
print(sum(v[0][0:S:6])%MOD)