import sys from sys import stdin from fractions import Fraction import math from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce, lru_cache from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(stdin.readline()) def i_map(): return map(int, stdin.readline().split()) def i_list(): return list(i_map()) def s_input(): return stdin.readline()[:-1] def s_map(): return s_input().split() def s_list(): return list(s_map()) def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 alpa = 'abcdefghijklmnopqrstuvwxyz' ALPA = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' def main(): N, M, K = i_map() G = [[] for i in range(300)] for i in range(M): p, q, c = i_map() p -= 1 q -= 1 G[p].append([q, c]) dp = [[[0] * (K+1) for i in range(N)] for i in range(N)] for i in range(N): dp[0][i][0] = 1 for i in range(N-1): for j in range(N): for k in range(K+1): for nxt, cost in G[j]: if k + cost <= K: dp[i+1][nxt][k+cost] += dp[i][j][k] dp[i+1][nxt][k+cost] %= MOD ans = 0 for i in range(N): ans += dp[-1][i][-1] ans %= MOD print(ans) if __name__ == '__main__': main()