import sys

def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def SI(): return sys.stdin.readline()[:-1]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
int1 = lambda x: int(x) - 1
def MI1(): return map(int1, sys.stdin.readline().split())
def LI1(): return list(map(int1, sys.stdin.readline().split()))
p2D = lambda x: print(*x, sep="\n")
dij = [(1, 0), (0, 1), (-1, 0), (0, -1)]

def dot(aa,bb):
    return [[sum(a*b for a,b in zip(row,col))%md for col in zip(*bb)] for row in aa]

def solve(n):
    if n == 3:
        ans = 0
        for p, q, r in pqr:
            if p == 1 and q == 1: ans += 1
        print(ans)
        exit()

    start = []
    end = []
    to = [[0] * m for _ in range(m)]
    for i in range(m):
        if pqr[i][0] == 1: start.append(i)
        if pqr[i][2] == 1: end.append(i)
        for j in range(m):
            if pqr[i][1:] == pqr[j][:2]: to[i][j] = 1
    # print(start,end)
    # print(to)

    cnt = [[0] * i + [1] + [0] * (m - i - 1) for i in range(m)]
    n -= 3
    while n:
        if n & 1: cnt = dot(cnt, to)
        to = dot(to, to)
        n >>= 1
    # print(cnt)

    ans = 0
    for s in start:
        for e in end:
            ans += cnt[s][e]
            ans %= md
    print(ans)

md=10**9+7
k,m,n=MI()
pqr=LLI(m)
solve(n)