import sys
input = sys.stdin.readline

mod=10**9+7

K,M,N=map(int,input().split())
CODE=[list(map(int,input().split())) for i in range(M)]

# 行列の計算（numpyを使えないとき,modを使用）
def prod(A,B,k,l,m):# A:k*l,B:l*m
    C=[[None for i in range(m)] for j in range(k)]

    for i in range(k):
        for j in range(m):
            ANS=0
            for pl in range(l):
                ANS=(ANS+A[i][pl]*B[pl][j])%mod

            C[i][j]=ANS

    return C

def plus(A,B,k,l):# a,B:k*l
    C=[[None for i in range(l)] for j in range(k)]

    for i in range(k):
        for j in range(l):
            C[i][j]=(A[i][j]+B[i][j])%mod

    return C

A=[[0]*M for i in range(M)]

for i in range(M):
    for j in range(M):
        if CODE[i][1:]==CODE[j][:2]:
            A[i][j]+=1

POWA=[A]

for i in range(60):
    POWA.append(prod(POWA[-1],POWA[-1],M,M,M)) # ベキを求めて

X=[[0]*M]
for i in range(M):
    if CODE[i][0]==1:
        X[0][i]+=1
n=N-3
while n:
    X=prod(X,POWA[n.bit_length()-1],1,M,M) # n乗の場合
    n-=1<<(n.bit_length()-1)

ANS=0
for i in range(M):
    if CODE[i][-1]==1:
        ANS+=X[0][i]
print(ANS%mod)