import java.io.*; import java.util.*; public class Main { static final int MOD = 1000000007; public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int k = sc.nextInt(); int m = sc.nextInt(); long n = sc.nextLong() - 2; long[][][] matrix = new long[60][k * k][k * k]; for (int i = 0; i < m; i++) { int p = sc.nextInt() - 1; int q = sc.nextInt() - 1; int r = sc.nextInt() - 1; matrix[0][q * k + r][p * k + q] = 1; } for (int i = 1; i < 60; i++) { for (int a = 0; a < k * k; a++) { for (int b = 0; b < k * k; b++) { for (int c = 0; c < k * k; c++) { matrix[i][a][c] += matrix[i - 1][a][b] * matrix[i - 1][b][c]; matrix[i][a][c] %= MOD; } } } } long[] ans = new long[k * k]; for (int i = 0; i < k; i++) { ans[i] = 1; } for (int i = 59; i >= 0; i--) { if (n < (1L << i)) { continue; } n -= (1L << i); long[] nexts = new long[k * k]; for (int a = 0; a < k * k; a++) { for (int b = 0; b < k * k; b++) { nexts[a] += matrix[i][a][b] * ans[b] % MOD; nexts[a] %= MOD; } } ans = nexts; } long result = 0; for (int i = 0; i < k * k; i += k) { result += ans[i]; result %= MOD; } System.out.println(result); } } class Scanner { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(""); StringBuilder sb = new StringBuilder(); public Scanner() throws Exception { } public int nextInt() throws Exception { return Integer.parseInt(next()); } public long nextLong() throws Exception { return Long.parseLong(next()); } public double nextDouble() throws Exception { return Double.parseDouble(next()); } public String next() throws Exception { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }