import java.io.*;
import java.util.*;
import java.util.function.*;
import java.util.stream.*;

public class Main {
    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();
        Map<Integer, Integer> graph = new HashMap<>();
        for (int i = 0; i < m; i++) {
            graph.put(sc.nextInt() - 1 + (sc.nextInt() - 1) * 300, sc.nextInt());
        }
        int[][][] dp = new int[n][k + 1][300];
        Arrays.fill(dp[0][0], 1);
        for (int i = 1; i < n; i++) {
            for (int x : graph.keySet()) {
                int left = x % 300;
                int right = x / 300;
                int v = graph.get(x);
                for (int j = 0; j + v <= k; j++) {
                    dp[i][j + v][right] += dp[i - 1][j][left];
                    dp[i][j + v][right] %= MOD;
                }
            }
        }
        System.out.println(Arrays.stream(dp[n - 1][k]).reduce(0, (a, b) -> (a + b) % MOD));
    }
}
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();
        }
    }
    
}