#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>

using namespace std;
typedef long long ll;
struct edge{
    int to, cost;
};
int N, M, K;
const ll MOD = 1000000007;
int P[300], Q[300], C[300];
ll dp[2][305][305];
vector<edge> v[305];

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    cin >> N >> M >> K;
    for(int i = 0; i < M; i++) {
        cin >> P[i] >> Q[i] >> C[i];
        P[i]--; Q[i]--;
        v[P[i]].push_back((edge){Q[i], C[i]});
    }
    for(int i = 0; i < 300; i++) dp[0][i][0] = 1;
    for(int i = 1; i < N; i++){
        int cur = i%2;
        int prev = (i+1)%2;
        for(int j = 0; j < 300; j++){
            for(int k = 0; k <= 300; k++){
                dp[cur][j][k] = 0;
            }
        }
        for(int j = 0; j < 300; j++){
            for(edge e : v[j]){
                int to = e.to; int cost = e.cost;
                for(int k = 0; k <= 300; k++){
                    if(k+cost <= 300){
                        dp[cur][to][k+cost] += dp[prev][j][k];
                        dp[cur][to][k+cost] %= MOD;
                    }
                }
            }
        }
    }
    ll ans = 0;
    for(int i = 0; i < 300; i++) {
        ans += dp[(N+1)%2][i][K];
        ans %= MOD;
    }
    cout << ans << endl;
}