/**
 *   @FileName	a.cpp
 *   @Author	kanpurin
 *   @Created	2020.07.10 23:58:25
**/

#include "bits/stdc++.h" 
using namespace std; 
typedef long long ll;

int MOD = 1e9 + 7;
struct mint {
private:
    long long x;
public:
    mint(long long x = 0) :x((MOD+x)%MOD) {}
    mint(std::string &s) {
        long long z = 0;
        for (int i = 0; i < s.size(); i++) {
            z *= 10;
            z += s[i] - '0';
            z %= MOD;
        }
        this->x = z;
    }
    mint& operator+=(const mint &a) {
        if ((x += a.x) >= MOD) x -= MOD;
        return *this;
    }
    mint& operator-=(const mint &a) {
        if ((x += MOD - a.x) >= MOD) x -= MOD;
        return *this;
    }
    mint& operator*=(const mint &a) {
        (x *= a.x) %= MOD;
        return *this;
    }
    mint& operator/=(const mint &a) {
        long long n = MOD - 2;
        mint u = 1, b = a;
        while (n > 0) {
            if (n & 1) {
                u *= b;
            }
            b *= b;
            n >>= 1;
        }
        return *this *= u;
    }
    mint operator+(const mint &a) const {
        mint res(*this);
        return res += a;
    }
    mint operator-(const mint &a) const {
        mint res(*this);
        return res -= a;
    }
    mint operator*(const mint &a) const {
        mint res(*this);
        return res *= a;
    }
    mint operator/(const mint &a) const {
        mint res(*this);
        return res /= a;
    }
    friend std::ostream& operator<<(std::ostream &os, const mint &n) {
        return os << n.x;
    }
    bool operator==(const mint &a) const {
        return this->x == a.x;
    }
};
int main() {
    int n,m,k;cin >> n >> m >> k;
    vector<vector<vector<mint>>> dp(n,vector<vector<mint>>(300,vector<mint>(k + 1,0)));
    for (int i = 0; i < 300; i++) {
        dp[0][i][0] = 1;
    }
    vector<tuple<int,int,int>> query(m);
    for (int i = 0; i < m; i++) {
        int p,q,c;cin >> p >> q >> c;
        p--;q--;
        query[i] = make_tuple(p,q,c);
    }
    for (int i = 0; i < n - 1; i++) {
        for (int j = 0; j < m; j++) {
            int p = get<0>(query[j]);
            int q = get<1>(query[j]);
            int c = get<2>(query[j]);
            for (int t = 0; t <= k - c; t++) {
                dp[i + 1][q][t + c] += dp[i][p][t];
            }
        }
    }
    mint ans = 0;
    for (int i = 0; i < 300; i++) {
        ans += dp[n-1][i][k];
    }
    cout << ans << endl;
    return 0;
}