#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<int, int>;
using PL = pair<lint, lint>;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define ALL(a)  (a).begin(),(a).end()
constexpr int MOD = 1000000007;
constexpr int INF = 2147483647;
void yes(bool expr) {
  cout << (expr ? "Yes" : "No") << "\n";
}
vector<vector<lint>> mxm(vector<vector<lint>> a, vector<vector<lint>> b, lint mod) {
  vector<vector<lint>> ret(a.size(), vector<lint>(a.size()));
  REP(i, a.size()) {
    REP(j, a.size()) {
      REP(k, a[0].size()) {
        ret[i][j] = (ret[i][j] + a[i][k]*b[k][j] % mod) % mod;
      }
    }
  }
  return ret;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    lint K, M, N;
    cin >> K >> M >> N;
    N -= 2;
    vector<vector<vector<lint>>> mat(60, vector<vector<lint>>(K*K, vector<lint>(K*K)));
    vector<vector<lint>> vec(K*K, vector<lint>(1));
    REP(i, M) {
        lint P, Q, R;
        cin >> P >> Q >> R;
        P--; Q--; R--;
        mat[0][Q+R*K][P+Q*K]++;
        if(P == 0) vec[P+Q*K][0] = 1;
    }
    REP(i, 59) mat[i+1] = mxm(mat[i], mat[i], MOD);
    REP(i, 60) if(N>>i&1) vec = mxm(mat[i], vec, MOD);
    lint ans = 0;
    REP(i, K) ans = (ans + vec[i][0]) % MOD;
    cout << ans << endl;
}