#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
// #include<ext/pb_ds/tag_and_trait.hpp>
// using namespace __gnu_pbds;
// #include<boost/multiprecision/cpp_int.hpp>
// namespace multiprecisioninteger = boost::multiprecision;
// using cint=multiprecisioninteger::cpp_int;
using namespace std;
using ll=long long;
#define double long double
using datas=pair<ll,ll>;
using ddatas=pair<double,double>;
using tdata=pair<ll,datas>;
using vec=vector<ll>;
using mat=vector<vec>;
using pvec=vector<datas>;
using pmat=vector<pvec>;
// using llset=tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>;
#define For(i,a,b) for(i=a;i<(ll)b;++i)
#define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i)
#define rep(i,N) For(i,0,N)
#define rep1(i,N) For(i,1,N)
#define brep(i,N) bFor(i,N,0)
#define brep1(i,N) bFor(i,N,1)
#define all(v) (v).begin(),(v).end()
#define allr(v) (v).rbegin(),(v).rend()
#define vsort(v) sort(all(v))
#define vrsort(v) sort(allr(v))
#define endl "\n"
#define eb emplace_back
#define print(v) cout<<v<<endl
#define printyes cout<<"Yes"<<endl
#define printno cout<<"No"<<endl
#define printYES cout<<"YES"<<endl
#define printNO cout<<"NO"<<endl
#define output(v) do{bool f=0;for(auto outi:v){cout<<(f?" ":"")<<outi;f=1;}cout<<endl;}while(0)
#define matoutput(v) do{for(auto outimat:v)output(outimat);}while(0)
const ll mod=1000000007;
// const ll mod=998244353;
const ll inf=1LL<<60;
const double PI = acos(-1);
const double eps = 1e-9;
template<class T> inline bool chmax(T& a,T b){bool x=a<b;if(x)a=b;return x;} 
template<class T> inline bool chmin(T& a,T b){bool x=a>b;if(x)a=b;return x;} 

void startupcpp(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout<<fixed<<setprecision(15);
}

double distance(ddatas x,ddatas y){
  double a=x.first-y.first,b=x.second-y.second;
  return sqrt(a*a+b*b);
}

ll modinv(ll a) {
  ll b=mod,u=1,v=0,t;
  while(b){
    t=a/b;
    a-=t*b; swap(a,b);
    u-=t*v; swap(u,v);
  }
  return (u+mod)%mod;
}

ll moddevide(ll a,ll b){return (a*modinv(b))%mod;}

vec modncrlistp,modncrlistm;

ll modncr(ll n,ll r){
  if(n<r)return 0;
  ll i,size=modncrlistp.size();
  if(size<=n){
    modncrlistp.resize(n+1);
    modncrlistm.resize(n+1);
    if(!size){
      modncrlistp[0]=modncrlistm[0]=1;
      size++;
    }
    For(i,size,n+1){
      modncrlistp[i]=modncrlistp[i-1]*i%mod;
      modncrlistm[i]=modinv(modncrlistp[i]);
    }
  }
  return modncrlistp[n]*modncrlistm[r]%mod*modncrlistm[n-r]%mod;
}

ll modpow(ll a,ll n){
  ll res=1;
  while(n>0){
    if(n&1)res=res*a%mod;
    a=a*a%mod;
    n>>=1;
  }
  return res;
}

ll gcd(ll a,ll b){if(!b)return abs(a);return (a%b==0)?abs(b):gcd(b,a%b);}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}

ll countdigits(ll n){
  ll ans=0;
  while(n){n/=10;ans++;}
  return ans;
}

ll sumdigits(ll n){
  ll ans=0;
  while(n){ans+=n%10;n/=10;}
  return ans;
}

void topcoder(vector<int>& v){
  string s;
  while(1){
    cin>>s;
    int i=s[0]=='{',x=0;
    while(s[i]>='0'&&s[i]<='9'){
      x=x*10+s[i]-'0';
      ++i;
    }
    v.eb(x);
    if(s[i]=='}')break;
  }
}
void topcoder(string& s){
  string t;
  cin>>t;
  int i=1;
  while(t[i]!='"'){
    s+=t[i++];
  }
}
class matrix{
  mat a;
  ll H,W;
public:
  matrix(mat& g):a(g){
    H=g.size();
    W=g[0].size();
  }
  matrix(ll i,ll j):a(i,vec(j,0)){H=i;W=j;}
  matrix(ll n):a(n,vec(n,0)){H=W=n;}
  inline vec& operator [](int k){
    assert(k>=0&&k<H);
    return a[k];
  }
  // matrix operator =(matrix b){
  //   this->a.swap(b->a);
  //   this->H=b.H;
  //   this->W=b.W;
  //   return (*this);
  // }
  matrix operator +=(matrix b){
    ll i,j;
    rep(i,this->H)rep(j,this->W)(*this)[i][j]+=b[i][j];
    return (*this);
  }
  matrix operator -=(matrix b){
    ll i,j;
    rep(i,this->H)rep(j,this->W)(*this)[i][j]-=b[i][j];
    return (*this);
  }
  matrix operator *=(matrix b){
    ll i,j,k;
    assert(this->W==b.H);
    matrix c(this->H,b.W);
    rep(i,this->H)rep(j,b.W){
      c[i][j]=0;
      rep(k,this->W)c[i][j]+=(*this)[i][k]*b[k][j]%mod;
      c[i][j]%=mod;
    }
    (*this)=c;
    return (*this);
  }
  matrix operator ^=(ll K){
    assert(this->H==this->W);
    matrix c(this->H);
    ll i;
    rep(i,this->H)c[i][i]=1;
    if(K&1)c*=(*this);
    while(K){
      K>>=1;
      (*this)*=(*this);
      if(K&1)c*=(*this);
    }
    this->a.swap(c.a);
    return (*this);
  }
  matrix operator +(matrix c){
    return matrix(*this)+=c;
  }
  matrix operator -(matrix c){
    return matrix(*this)-=c;
  }
  matrix operator *(matrix c){
    return matrix(*this)*=c;
  }
  matrix operator ^(ll K){
    return matrix(*this)^=K;
  }
  void out(){
    for(auto x:a)output(x);
  }
};

ll N,M,K,H,W,A,B,C,D;
string s,t;
int main(){
  // startupcpp();
  // int codeforces;cin>>codeforces;while(codeforces--){
  ll i,j,k;
  cin>>K>>M>>N;
  N-=2;
  matrix a(K*K),v(K*K,1);
  rep(i,K)v[i][0]=1;
  while(M--){
    cin>>i>>j>>k;
    --i;--j;--k;
    a[j*K+k][i*K+j]=1;
  }
  // a.out();
  // v.out();
  a^=N;
  // a.out();
  v=a*v;
  // v.out();
  rep(i,K)A+=v[i*K][0];
  print(A%mod);
}