#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please

ll dp[2][301][301];

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);


	int N, M, K;
	cin >> N >> M >> K;
	int P[300], Q[300], C[300];
	rep(i, M) {
		cin >> P[i] >> Q[i] >> C[i];
		P[i]--;
		Q[i]--;
	}

	rep(i, 300) dp[0][i][0] = 1;
	const int mod = 1e9 + 7;

	rep(i, N - 1) {
		rep(j, M) {
			rep(k, K + 1) {
				if (k + C[j] <= K) dp[1][Q[j]][k + C[j]] += dp[0][P[j]][k];
			}
		}

		rep(j, 301) rep(k, K + 1) {
			dp[0][j][k] = dp[1][j][k] % mod;
			dp[1][j][k] = 0;
		}
	}

	ll kotae = 0;
	rep(j, 301) kotae += dp[0][j][K];
	co(kotae% mod);




	Would you please return 0;
}