#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please

const int mod = 1e9 + 7;
ll E[61][36][36];

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);


	ll K, M, N;
	cin >> K >> M >> N;

	rep(i, M) {
		int p, q, r;
		cin >> p >> q >> r;
		p--;
		q--;
		r--;

		E[0][q * 6 + r][p * 6 + q] = 1;

	}
	rep(i, 60) {
		rep(p, 36) {
			rep(q, 36) {
				rep(r, 36) {
					E[i + 1][p][q] += E[i][p][r] * E[i][r][q] % mod;
				}
				E[i + 1][p][q] %= mod;
			}
		}
	}

	ll A[36] = {};
	rep(i, 6) A[i] = 1;
	N -= 2;

	rep(i, 60) if (N >> i & 1) {
		ll kari[36] = {};
		rep(p, 36) rep(q, 36) {
			kari[p] += E[i][p][q] * A[q] % mod;
		}
		rep(j, 36) A[j] = kari[j] % mod;
	}

	ll kotae = 0;
	rep(i, 6) kotae += A[i * 6];

	co(kotae% mod);


	Would you please return 0;
}