#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <iomanip>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cassert>
#include <complex>
#include <stdio.h>
#include <time.h>
#include <numeric>
#include <random>
#include <unordered_map>
#include <unordered_set>
#define all(a) a.begin(),a.end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pb push_back
#define debug(x) cerr << #x << ':' << x << '\n';
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
typedef complex<ld> com;
constexpr int inf = 1000000010;
constexpr ll INF = 1000000000000000010;
constexpr ld eps = 1e-12;
constexpr ld pi = 3.141592653589793238;
template<class T, class U> inline bool chmax(T &a, const U &b) { if (a < b) { a = b; return true; } return false; }
template<class T, class U> inline bool chmin(T &a, const U &b) { if (a > b) { a = b; return true; } return false; }

constexpr ll mod = 1000000007;
ll dp[310][310][310];

struct edge {
	ll from, to, cost;
};

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	cout << fixed << setprecision(20);

	ll n, m, k;
	cin >> n >> m >> k;
	vector<edge> a(m);
	rep(i, m) {
		ll u, v, c;
		cin >> u >> v >> c;
		u--; v--;
		a[i] = { u,v,c };
	}
	rep(i, 310) dp[0][i][0] = 1;
	rep(i, n - 1) {
		rep(j, m) {
			rep(x, 310) {
				if (x + a[j].cost <= k) {
					dp[i + 1][a[j].to][x + a[j].cost] += dp[i][a[j].from][x];
					dp[i + 1][a[j].to][x + a[j].cost] %= mod;
				}
			}
		}
	}
	ll ans = 0;
	rep(i, 310) ans += dp[n - 1][i][k];
	cout << ans % mod << '\n';
}