#include<bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
#define rep(i,n) for(int i=0; i<(n); i++)

const ULL MOD = 1000000007;
int N, M, K;
ULL dp[300][300][301] = {};
ULL Ch[300][3];

int main() {
    cin >> N >> M >> K;
    rep(i, M) {
        rep(j, 3) cin >> Ch[i][j];
        Ch[i][0]--; Ch[i][1]--;
    }
    rep(i, 300) dp[0][i][0] = 1;

    rep(n, N - 1) rep(k, K + 1) {
        rep(m, M) {
            if (Ch[m][2] > k) continue;
            dp[n + 1][Ch[m][1]][k] += dp[n][Ch[m][0]][k - Ch[m][2]];
        }
        rep(s, 300) dp[n + 1][s][k] %= MOD;
    }

    ULL ans = 0;
    rep(i, 300) ans += dp[N - 1][i][K];
    ans %= MOD;
    cout << ans << endl;

    return 0;
}