#include using namespace std; typedef long long ll; typedef pair p_ll; template void debug(T itr1, T itr2) { auto now = itr1; while(now=0; i--) const ll MOD = pow(10,9)+7; const ll LLINF = pow(2,61)-1; const int INF = pow(2,30)-1; vector fac; void c_fac(int x=pow(10,6)+10) { fac.resize(x,true); rep(i,x) fac[i] = i ? (fac[i-1]*i)%MOD : 1; } ll inv(ll a, ll m=MOD) { ll b = m, x = 1, y = 0; while (b!=0) { int d = a/b; a -= b*d; swap(a,b); x -= y*d; swap(x,y); } return (x+m)%m; } ll nck(ll n, ll k) { return fac[n]*inv(fac[k]*fac[n-k]%MOD)%MOD; } ll gcd(ll a, ll b) { if (a> matdot(vector> A, vector> B) { if (A[0].size()!=B.size()) return {{}}; ll h = A.size(), w = B[0].size(), x = A[0].size(); vector> result(h,vector(w,0)); rep(i,h) rep(j,w) rep(k,x) result[i][j] = (result[i][j] + A[i][k]*B[k][j])%MOD; return result; } vector> matpow(vector> A, ll n) { if (A.size()!=A[0].size()) return {{}}; int N = A.size(); vector> result(N,vector(N,0)), now; copy(all(A),back_inserter(now)); rep(i,N) result[i][i] = 1; ll p2 = 1; while (n>=p2) { if (n&p2) result = matdot(result,now); now = matdot(now,now); p2 *= 2; } return result; } // ---------------------------------------------------------------------- // ---------------------------------------------------------------------- int main() { ll K, M, N; cin >> K >> M >> N; vector> mat(K*K, vector(K*K,0)); rep(i,M) { ll p, q, r; cin >> p >> q >> r; p--; q--; r--; mat[p+q*K][q+r*K] = 1; } // rep(i,K*K) debug(all(mat[i])); vector> matn = matpow(mat,N-2); ll result = 0; rep(i,K) rep(j,K) result = (result+matn[i*K][j]) % MOD; cout << result << endl; return 0; }