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 = NList;
        var (n, m, k) = (c[0], c[1], c[2]);
        var map = NArr(m);
        var tree = new List<(int to, int cmp)>[300];
        for (var i = 0; i < tree.Length; ++i) tree[i] = new List<(int to, int cmp)>();
        foreach (var edge in map)
        {
            tree[edge[0] - 1].Add((edge[1] - 1, edge[2]));
        }
        var mod = 1_000_000_007;
        var dp = new long[300, k + 1];
        for (var i = 0; i < 300; ++i) dp[i, 0] = 1;
        for (var i = 0; i + 1 < n; ++i)
        {
            var ndp = new long[300, k + 1];
            for (var j = 0; j < 300; ++j)
            {
                foreach (var next in tree[j])
                {
                    for (var ck = 0; ck <= k; ++ck)
                    {
                        if (ck + next.cmp > k) break;
                        ndp[next.to, ck + next.cmp] = (ndp[next.to, ck + next.cmp] + dp[j, ck]) % mod;
                    }
                }
            }
            dp = ndp;
        }
        var ans = 0L;
        for (var i = 0; i < n; ++i) ans += dp[i, k];
        WriteLine(ans % mod);
    }
}