#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
using ll = long long;

constexpr int P = 1000000007;

struct X {
    int p, q, c;
};

int dp[2][300][301];
X x[300];

int main() {
    int n, m, k;
    cin >> n >> m >> k;

    for (int j = 0; j < m; j++) {
        int p, q, c;
        cin >> p >> q >> c;
        p--; q--;

        x[j] = { p, q, c };
    }

    auto d0 = dp[0];
    auto d1 = dp[1];
    for (int l = 0; l < 300; l++) {
        d0[l][0] = 1;
    }
    for (int i = 1; i < n; i++) {
        for (int l = 0; l < 300; l++) {
            for (int h = 0; h <= k; h++) {
                d1[l][h] = 0;
            }
        }
        for (int j = 0; j < m; j++) {
            auto [p, q, c] = x[j];
            for (int h = c; h <= k; h++) {
                auto &t = d1[q][h];
                t += d0[p][h - c];
                if (t >= P) t -= P;
            }
        }
        swap(d0, d1);
    }

    ll r = 0;
    for (int l = 0; l < 300; l++) {
        r += d0[l][k];
    }
    cout << r % P << endl;

    return 0;
}