import java.util.*; import java.io.*; public class Main { static int n,m,k; static int[][] map; static long mod = (long)Math.pow(10,9)+7; public static void main(String[] args) throws Exception { FastScanner sc = new FastScanner(System.in); n = sc.nextInt(); m = sc.nextInt(); k = sc.nextInt(); map = new int[300][300]; for(int i = 0; i < n; i++){ Arrays.fill(map[i],3000); } for(int i = 0; i < m; i++){ int p = sc.nextInt()-1; int q = sc.nextInt()-1; int c = sc.nextInt(); map[p][q] = c; } long ans = 0; for(int i = 0; i < n; i++){ ans += dfs(i,0,1); ans %= mod; } System.out.println(ans); } public static int dfs(int now, int cost, int cnt){ if(cnt == n){ return cost == k ? 1 : 0; } int ret = 0; for(int i = 0; i < 300; i++){ if(cost + map[now][i] <= k){ ret += dfs(i,cost+map[now][i],cnt+1); } } return ret; } } class FastScanner { private BufferedReader reader = null; private StringTokenizer tokenizer = null; public FastScanner(InputStream in) { reader = new BufferedReader(new InputStreamReader(in)); tokenizer = null; } public String next() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { tokenizer = new StringTokenizer(reader.readLine()); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken(); } public String nextLine() { if (tokenizer == null || !tokenizer.hasMoreTokens()) { try { return reader.readLine(); } catch (IOException e) { throw new RuntimeException(e); } } return tokenizer.nextToken("\n"); } public long nextLong() { return Long.parseLong(next()); } public int nextInt() { return Integer.parseInt(next()); } public double nextDouble() { return Double.parseDouble(next()); } public String[] nextArray(int n) { String[] a = new String[n]; for (int i = 0; i < n; i++) a[i] = next(); return a; } public int[] nextIntArray(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = nextInt(); return a; } public long[] nextLongArray(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nextLong(); return a; } }