#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

#define P 1000000007
vvl dot(vvl A, vvl B){
  vvl C = VV(A.size(), B[0].size(), 0, ll);
  for(int i=0;i<A.size();i++){
    for(int j=0;j<B[0].size();j++){
      for(int k=0;k<B.size();k++) {
        C[i][j] = (C[i][j] + (A[i][k]*B[k][j])%P)%P;
      }
    }
  }
  return C;
}
vvl mat_pow(vvl A, ll t){
  if(t==0){
    vvl E = VV(A.size(), A.size(), 0, ll);
    re(i, A.size()) E[i][i] = 1;
    return E;
  }
  bool flag = true;
  vvl s;
  bitset<64> b(t);
  for(ll i=0;i<64;i++){
    if(b[i]) {
      if(flag) flag = false, s = A;
      else s = dot(A, s);
    }
    A = dot(A, A);
  }
  return s;
}

int main(int argc, char const *argv[]) {
  ll k, m, n;std::cin >> k >> m >> n;
  vvl a = VV(k*k, k*k, 0, ll);
  vvl d = VV(m, 3, 0, ll);
  re(i, m) {
    scanf("%lld %lld %lld", &d[i][0],&d[i][1],&d[i][2]);
    d[i][0]--, d[i][1]--, d[i][2]--;
  }

  for(int i=0;i<k;i++){
    for(int j=0;j<k;j++){
      for(int l=0;l<k;l++){
        for(int x=0;x<m;x++){
          if(d[x][0]==i&&d[x][1]==j&&d[x][2]==l){
            a[i*k+j][j*k+l] = 1;
          }
        }
      }
    }
  }

  vvl b = mat_pow(a, n-2);

  ll ans = 0;
  for(int i=0;i<k;i++){//0, i -> j, 1
    for(int j=0;j<k;j++){
      ans = (ans + b[i][j*k])%P;
    }
  }
  std::cout << ans << '\n';
  return 0;
}