#include <iostream>
#include <vector>

using namespace std;
typedef long long ll;
typedef vector<vector<ll>> vvl;
ll mod = 1000000007;
vvl mul(const vvl &a,const vvl &b){
    int i,j,k,n = a.size();
	vvl c(n,vector<ll>(n,0));
	for(i=0;i<n;i++){
		for(j=0;j<n;j++){
			for(k=0;k<n;k++) (c[i][j] += a[i][k]*b[k][j]%mod) %= mod;
		}
	}
	return c;
}

vector<ll> mul2(vvl &a,vector<ll> b){
    int i,j,n = a.size();
    vector<ll> c(n);
    for(i=0;i<n;i++){
        for(j=0;j<a[i].size();j++) (c[i] += a[i][j]*b[j]%mod) %= mod;
    }
	return c;
}

vvl mat_pw(vvl &a, ll x){
    int i,j,k,n = a.size();
	vvl ret(n,vector<ll>(n,0));
	for(i=0;i<n;i++) ret[i][i] = 1;
	while(x){
        if(x&1) ret = mul(ret,a);
		a = mul(a,a); x /= 2;
	}
	return ret;
}

bool ok[6][6][6];
int main(){
    int i,j,l,r,k,m,n; cin >> k >> m >> n;
    for(i=0;i<k;i++){
        for(j=0;j<k;j++){
            for(l=0;l<k;l++) ok[i][j][l] = false; 
        }
    }
    for(i=0;i<m;i++){
        int p,q,r; cin >> p >> q >> r; p--; q--; r--;
        ok[p][q][r] = true;
    }
    int sz = k*k*k;
    vvl mat(sz);
    for(i=0;i<sz;i++) mat[i].resize(sz);
    for(i=0;i<k;i++){
        for(j=0;j<k;j++){
            for(l=0;l<k;l++){
                for(r=0;r<k;r++){
                    if(!ok[j][l][r]) continue;
                    int pos1 = k*k*i + k*j + l;
                    int pos2 = k*k*j + k*l + r;
                    mat[pos2][pos1] = 1;
                }
            }
        }
    }
    mat = mat_pw(mat,n - 3);
    vector<ll> v(sz);
    for(i=0;i<1;i++){
        for(j=0;j<k;j++){
            for(l=0;l<k;l++){
                if(ok[i][j][l]) v[k*k*i + j*k + l] = 1;
            }
        }
    }
    v = mul2(mat,v);
    ll ans = 0;
    for(i=0;i<k;i++){
        for(j=0;j<k;j++){
            for(l=0;l<1;l++) (ans += v[k*k*i + k*j + l]) %= mod;   
        }
    }
    cout << ans << endl;
}