using System; using static System.Console; using System.Linq; using System.Collections.Generic; class Program { static int NN => int.Parse(ReadLine()); static int[] NList => ReadLine().Split().Select(int.Parse).ToArray(); static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray(); public static void Main() { Solve(); } static void Solve() { var c = ReadLine().Split(); var (k, m, n) = (int.Parse(c[0]), int.Parse(c[1]), long.Parse(c[2])); var map = NArr(m); var mod = 1_000_000_007; var a = new long[1][]; a[0] = new long[k * k]; for (var i = 0; i < k; ++i) a[0][i] = 1; var x = new long[k * k][]; for (var i = 0; i < x.Length; ++i) x[i] = new long[k * k]; foreach (var edge in map) { var p = edge[0] - 1; var q = edge[1] - 1; var r = edge[2] - 1; x[p * k + q][q * k + r] = 1; } var b = Matrix.Mul(a, Matrix.Pow(x, n - 2)); var ans = 0L; for (var i = 0; i < k; ++i) ans += b[0][k * i]; WriteLine(ans % mod); } class Matrix { static int mod = 1_000_000_007; // 行列の累乗 public static long[][] Pow(long[][] m, long k) { var multi = m; var r = new long[m.Length][]; for (var i = 0; i < m.Length; ++i) { r[i] = new long[m.Length]; r[i][i] = 1; } while (k > 0) { if ((k & 1) == 1) r = Mul(r, multi); multi = Mul(multi, multi); k >>= 1; } return r; } // 行列の積 public static long[][] Mul(long[][] x, long[][] y) { var r = new long[x.Length][]; for (var i = 0; i < x.Length; ++i) r[i] = new long[y[0].Length]; for (var i = 0; i < x.Length; ++i) for (var k = 0; k < x[0].Length; ++k) { for (var j = 0; j < y[0].Length; ++j) r[i][j] = (r[i][j] + x[i][k] * y[k][j]) % mod; } return r; } } }