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]|=(a[i][k]&b[k][j])
  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

N,M,T=map(int,input().split())
A=[[0]*N for i in range(N)]
for i in range(M):
  a,b=map(int,input().split())
  A[a][b]=1
C=p(A,T)
print(sum([C[0][i] for i in range(N)]))