import java.io.*; import java.util.*; import java.util.function.*; import java.util.stream.*; public class Main { static List> graph = new ArrayList<>(); static int[][][] dp; static final int MOD = 1000000007; public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); int m = sc.nextInt(); int k = sc.nextInt(); for (int i = 0; i < 300; i++) { graph.add(new HashMap<>()); } for (int i = 0; i < m; i++) { int a = sc.nextInt() - 1; int b = sc.nextInt() - 1; int c = sc.nextInt(); graph.get(b).put(a, c); } int ans = 0; dp = new int[n][300][k + 1]; for (int[][] arr1 : dp) { for (int[] arr2 : arr1) { Arrays.fill(arr2, -1); } } for (int i = 0; i < 300; i++) { ans += dfw(n - 1, i, k); ans %= MOD; } System.out.println(ans); } static int dfw(int idx, int v, int w) { if (w < 0) { return 0; } if (idx == 0) { if (w == 0) { return 1; } else { return 0; } } if (dp[idx][v][w] < 0) { dp[idx][v][w] = 0; for (int x : graph.get(v).keySet()) { dp[idx][v][w] += dfw(idx - 1, x, w - graph.get(v).get(x)); dp[idx][v][w] %= MOD; } } return dp[idx][v][w]; } } class Scanner { BufferedReader br; StringTokenizer st = new StringTokenizer(""); StringBuilder sb = new StringBuilder(); public Scanner() { try { br = new BufferedReader(new InputStreamReader(System.in)); } catch (Exception e) { } } public int nextInt() { return Integer.parseInt(next()); } public long nextLong() { return Long.parseLong(next()); } public double nextDouble() { return Double.parseDouble(next()); } public String next() { try { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } } catch (Exception e) { e.printStackTrace(); } finally { return st.nextToken(); } } }