K,M,N=map(int,input().split())
A=[[0]*(K*K) for i in range(K*K)]
for i in range(0,K*K,K):
  A[i][-1]=1
P,Q,R=0,0,0
B=[[0]*(K*K) for i in range(K*K)]
for i in range(M):
  P,Q,R=map(int,input().split())
  P,Q,R=P-1,Q-1,R-1
  B[Q+R*K][P+Q*K]+=1
mod=10**9+7
def m(a,b):
  r=[[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])):
        r[i][j]=(r[i][j]+a[i][k]*b[k][j])%mod
  return r

def p(a,n):
  r=[[0]*len(a) for i in range(len(a))]
  b=[]
  for i in range(len(a)):
    r[i][i]=1
    b.append(a[i][:])
  l=n
  while l>0:
    if l&1:
      r=m(b,r)
    b=m(b,b)
    l>>=1
  return r

X=m(p(B,N-2),A)
print(sum(map(lambda x:x[-1],X[:K]))%mod)