#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD=1e9+7;
vector<vector<ll>> matrixmul(int l, int m, int n, vector<vector<ll>> a, vector<vector<ll>> b){
	vector<vector<ll>> c(l, vector<ll>(n));
	for(int i=0; i<l; i++){
        for(int k=0; k<m; k++){
		    for(int j=0; j<n; j++){
				(c[i][j]+=a[i][k]*b[k][j])%=MOD;
			}
		}
	}
	return c;
}
vector<vector<ll>> matrixpow(int n, vector<vector<ll>> a, ll k){
	vector<vector<ll>> ap=a, ans(n, vector<ll>(n));
	for(int i=0; i<n; i++) ans[i][i]=1;
	while(k){
		if(k&1) ans=matrixmul(n, n, n, ap, ans);
		ap=matrixmul(n, n, n, ap, ap);
		k>>=1;
	}
	return ans;
}
int main()
{
    int k, m; ll n;
    cin>>k>>m>>n;
    vector<vector<ll>> mat(k*k, vector<ll>(k*k));
    int p[300], q[300], r[300];
    for(int i=0; i<m; i++){
        cin>>p[i]>>q[i]>>r[i];
        p[i]--; q[i]--; r[i]--;
        mat[p[i]*k+q[i]][q[i]*k+r[i]]=1;
    }
    auto matp=matrixpow(k*k, mat, n-2);
    ll ans=0;
    for(int i=0; i<k; i++){
        for(int j=0; j<k*k; j+=k){
            (ans+=matp[i][j])%=MOD;
        }
    }
    cout<<ans<<endl;
    return 0;
}