#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
using namespace std;
typedef long long int ll;
using ull = unsigned long long;

constexpr ll mod=1e9+7;

int dp[301][301][301];

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n,m,k; cin >> n >> m >> k;
    vector<int> p(m),q(m),c(m);
    for(int i=0;i<m;i++){
        cin >> p[i] >> q[i] >> c[i];
        p[i]--; q[i]--;
        dp[2][q[i]][c[i]]++;
    }
    for(int i=2;i<n;i++){
        for(int j=0;j<m;j++){
            for(int l=0;l<=k;l++){
                if(l+c[j]<=k)(dp[i+1][q[j]][l+c[j]]+=dp[i][p[j]][l])%=mod;
            }
        }
    }
    int res=0;
    for(int i=0;i<=300;i++){
        (res+=dp[n][i][k])%=mod;
    }
    cout << res << endl;
}