#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i,n) for(ll i=0;i<(n);i++)
#define pll pair<ll,ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define lb(c,x) distance(c.begin(),lower_bound(all(c),x))
#define ub(c,x) distance(c.begin(),upper_bound(all(c),x))

using namespace std;

template<class T> inline bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T> inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}

const ll mod=1e9+7;

using vv=vector<vector<ll>>;
const ll MOD=1e9+7;

vv E(int n) //行列の初期化（単位行列）
{
  vv res(n, vector<ll>(n));
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++)
      res[i][j] = (i == j); //対角成分を1に、それ以外を0にする。
  return res;
}

vv matprod(vv A, vv B) //行列の掛け算
{
  int l = A.size(), m = B.size(), n = B[0].size();
  vv res(l, vector<ll>(n, 0));
  for (int i = 0; i < l; i++)
    for (int j = 0; j < n; j++)
      for (int k = 0; k < m; k++)
        res[i][j] = (res[i][j] + A[i][k] * B[k][j]) % MOD;
  return res;
}

vv matpow(vv A, ll n) //行列累乗
{
  vv p = A, res = E(A.size());
  while (n > 0)
  {
    if (n & 1)
      res = matprod(res, p);
    p = matprod(p, p);
    n >>= 1;
  }
  return res;
}

int main() {
    ll k,m,n;
    cin >> k >> m >> n;
    vector<ll> p(m),q(m),r(m);
    rep(i,m){
        cin >> p[i] >> q[i] >> r[i];
        p[i]--; q[i]--; r[i]--;
    }
    vv a(k*k,vector<ll>(1));
    rep(j,m){
        if(p[j]==0){
            a[q[j]+r[j]*k][0]++;
        }
    }
    vv tran(k*k,vector<ll>(k*k));
    rep(j,m){
        if(p[j]>=k || q[j]>=k || r[j]>=k) continue;
        ll s=p[j]+q[j]*k;
        ll t=q[j]+r[j]*k;
        tran[t][s]++;
    }
    tran=matpow(tran,n-3);
    a=matprod(tran,a);
    ll ans=0;
    rep(i,k){
        ans+=a[i][0];
        ans%=mod;
    }
    cout << ans << endl;
    return 0;
}