#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<n; i++)
#define pb push_back
//#define int long long
typedef vector<long long> vec;
typedef vector<vec> mat;
const long long MOD = 1000000007;

int K, M;
long long N;
int serial[10][10][10];
bool ok[220];

mat mat_mul(mat A, mat B) {
    mat C(A.size(), vec(B[0].size()));
    
    for (int i=0; i<A.size(); i++) {
        for (int j=0; j<B[0].size(); j++) {
            for (int k=0; k<A[0].size(); k++) {
                C[i][j] += A[i][k]*B[k][j];
                C[i][j] %= MOD;
            }
        }
    }
    
    return C;
}

mat mat_pow(mat A, long long n) {
    mat res(A.size(), vec(A.size()));
    
    for (int i=0; i<A.size(); i++) {
        res[i][i] = 1;
    }
    
    while (n > 0) {
        if (n & 1) {
            res = mat_mul(A, res);
        }
        
        n >>= 1;
        A = mat_mul(A, A);
    }
    
    return res;
}
 
int main() {
    cin.tie(0); ios::sync_with_stdio(false);
    cin >> K >> M >> N;
    if (N==3) {
        int ans = 0;
        rep(i, M) {
            int P, Q, R; cin >> P >> Q >> R;
            if (P==1 && R==1) ans++;
        }
        cout << ans << endl;
        exit(0);
    }
    
    int c = 0;
    rep(i, K) rep(j, K) rep(k, K) {
        serial[i][j][k] = c;
        c++;
    }
    rep(i, M) {
        int P, Q, R; cin >> P >> Q >> R;
        ok[serial[P-1][Q-1][R-1]] = true;
    }
    mat A(c, vec(c));
    rep(i, K) rep(j, K) rep(k, K) rep(l, K) {
        if (ok[serial[i][j][k]] && ok[serial[j][k][l]]) {
            A[serial[i][j][k]][serial[j][k][l]] = 1;
        }
    }
    mat res = mat_pow(A, N-3);
    long long ans = 0;
    rep(i, K) rep(j, K) rep(k, K) rep(l, K) {
        ans += res[serial[0][i][j]][serial[k][l][0]];
        ans %= MOD;
    }
    cout << ans << endl;
}