#include <bits/stdc++.h>

int ri() {
	int n;
	scanf("%d", &n);
	return n;
}

#define MOD 1000000007

int main() {
	int n = ri();
	int m = ri();
	int sum = ri();
	struct Next {
		int from;
		int to;
		int cost;
	};
	std::vector<Next> hens;
	for (int i = 0; i < m; i++) {
		int x = ri() - 1;
		int y = ri() - 1;
		hens.push_back({x, y, ri()});
	}
	
	int dp[300][sum + 1];
	memset(dp, 0, sizeof(dp));
	for (int i = 0; i < 300; i++) dp[i][0] = 1;
	for (int i = 1; i < n; i++) {
		int next[300][sum + 1];
		memset(next, 0, sizeof(next));
		for (auto j : hens) {
			for (int k = 0; k <= sum - j.cost; k++) {
				next[j.to][k + j.cost] += dp[j.from][k];
				if (next[j.to][k + j.cost] >= MOD) next[j.to][k + j.cost] -= MOD;
			}
		}
		memcpy(dp, next, sizeof(next));
	}
	int64_t res = 0;
	for (int i = 0; i < 300; i++) res += dp[i][sum];
	printf("%d\n", (int) (res % MOD));
	return 0;
}