import java.util.*;

public class Main{
    
    static final int MOD = (int)1e9+7;
    
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int n = Integer.parseInt(sc.next());
        int m = Integer.parseInt(sc.next());
        int k = Integer.parseInt(sc.next());
        
        int[][] complexity = new int[301][301];
        for(int i=0; i<m; i++){
            int p = Integer.parseInt(sc.next());
            int q = Integer.parseInt(sc.next());
            int c = Integer.parseInt(sc.next());
            complexity[p][q] = c;
        }
        
        int[][][] dp = new int[n][301][k+1];
        for(int i=1; i<=300; i++){
            dp[0][i][0] = 1;
        }
        for(int i=1; i<n-1; i++){
            for(int now=1; now<=300; now++){
                for(int j=0; j<k; j++){
                    for(int next=1; next<=300; next++){
                        int sum = j+complexity[now][next];
                        if(sum <= k){
                            dp[i][next][sum] += dp[i-1][now][j];
                            dp[i][next][sum] %= MOD;
                        }
                    }
                }
            }
        }
        
        int ans = 0;
        for(int i=1; i<=300; i++){
            ans += dp[n-2][i][k];
            ans %= MOD;
        }
        
        System.out.println(ans);
    }
}