#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 1'000'000'009;
using Mint = ModInt<MO>;


struct Scc {
  int n;
  vector<int> as, bs;
  vector<int> ptr, zu, us;

  int l;
  vector<int> ids;
  int operator[](int u) const { return ids[u]; }

  Scc() {}
  explicit Scc(int n_) : n(n_), as(), bs(), l(-1) {}
  void ae(int u, int v) {
    assert(0 <= u); assert(u < n);
    assert(0 <= v); assert(v < n);
    as.push_back(u);
    bs.push_back(v);
  }

  void dfs0(int u) {
    if (!ids[u]) {
      ids[u] = -1;
      for (int i = ptr[u]; i < ptr[u + 1]; ++i) dfs0(zu[i]);
      us.push_back(u);
    }
  }
  void dfs1(int u) {
    if (!~ids[u]) {
      ids[u] = l;
      for (int i = ptr[u]; i < ptr[u + 1]; ++i) dfs1(zu[i]);
    }
  }
  void run() {
    const int m = as.size();
    ptr.resize(n + 2);
    zu.resize(m);
    for (int u = 0; u < n + 2; ++u) ptr[u] = 0;
    for (int i = 0; i < m; ++i) ++ptr[as[i] + 2];
    for (int u = 2; u < n + 1; ++u) ptr[u + 1] += ptr[u];
    for (int i = 0; i < m; ++i) zu[ptr[as[i] + 1]++] = bs[i];
    ids.assign(n, 0);
    us.clear();
    for (int u = 0; u < n; ++u) dfs0(u);
    for (int u = 0; u < n + 2; ++u) ptr[u] = 0;
    for (int i = 0; i < m; ++i) ++ptr[bs[i] + 2];
    for (int u = 2; u < n + 1; ++u) ptr[u + 1] += ptr[u];
    for (int i = 0; i < m; ++i) zu[ptr[bs[i] + 1]++] = as[i];
    l = 0;
    for (int j = n; --j >= 0; ) if (!~ids[us[j]]) { dfs1(us[j]); ++l; }
  }

  vector<vector<int>> group() const {
    assert(~l);
    vector<vector<int>> uss(l);
    for (int u = 0; u < n; ++u) uss[ids[u]].push_back(u);
    return uss;
  }
};  // Scc


/*
  X := { x \in \Z | AND[1<=m<=M] A[m][x mod m] }
  ans := (period of X)
  
  B[m][r] := [\exists x \in X,  x == r (mod m)]
  
  Claim. ans = LCM[1<=m<=M] (period of B[m])
    (ans | LCM) OK
    (LCM | ans) for each m,
                for any r s.t. B[m][r] = 1, B[m][(r + ans) mod m] = 1
                ==> (period of B[m]) | gcd(m, ans)
*/
namespace solver {
constexpr int M = 100;
// \prod[p^2<=M] p^(ceil(log_p(M)/2)) = 2^3 3^2 5^1 7^1
constexpr int L = 2520;

int lpf[M + 1];
bitset<M> A[M + 1], B[M + 1], C[M + 1];
bitset<L> D[L + 1];

void init() {
  for (int p = 2; p <= M; ++p) lpf[p] = p;
  for (int p = 2; p <= M; ++p) if (lpf[p] == p) {
    for (int n = 2 * p; n <= M; n += p) chmin(lpf[n], p);  
  }
  for (int m = 1; m <= M; ++m) A[m].reset();
}

void run() {
// for(int m=1;m<=M;++m)if((~A[m])._Find_first()<m){cerr<<"A["<<m<<"] = ";for(int r=0;r<m;++r)cerr<<A[m][r];cerr<<endl;}
  for (int m = 1; m <= M; ++m) B[m].reset();
  for (int s = 0; s < L; ++s) {
    /*
      assume x == s (mod L)
      x = L y + s
      
      C[p]: y mod p  for p^2 > M
      D[l]: y mod l  for l | L
    */
    for (int p = 2; p <= M; ++p) if (p*p > M && lpf[p] == p) {
      C[p].reset();
      for (int y = 0; y < p; ++y) C[p][y] = true;
    }
    for (int l = 1; l <= L; ++l) if (L % l == 0) {
      D[l].reset();
      for (int y = 0; y < l; ++y) D[l][y] = true;
    }
    for (int m = 1; m <= M; ++m) {
      const int g = __gcd(L, m);
      const int p = m / g;
      if (p*p > M && lpf[p] == p) {
        bitset<M> tmp;
        for (int r = s % g; r < m; r += g) if (A[m][r]) tmp[r % p] = true;
        C[p] &= tmp;
      } else {
        assert(L % p == 0);
        bitset<L> tmp;
        for (int y = 0; y < p; ++y) if (A[m][(L * y + s) % m]) tmp[y] = true;
        D[p] &= tmp;
      }
    }
    for (int l = 1; l < L; ++l) if (L % l == 0) {
      for (int y = 0; y < l; ++y) if (!D[l][y]) {
        for (int z = y; z < L; z += l) D[L][z] = false;
      }
    }
    bool ok = true;
    for (int p = 2; p <= M; ++p) if (p*p > M && lpf[p] == p) ok = ok && C[p].any();
    ok = ok && D[L].any();
    if (ok) {
      for (int m = 1; m <= M; ++m) {
        const int g = __gcd(L, m);
        const int p = m / g;
        if (p*p > M && lpf[p] == p) {
          for (int r = s % g; r < m; r += g) if (C[p][r % p]) B[m][r] = true;
        } else {
          for (int y = 0; y < L; ++y) if (D[L][y]) B[m][(L * y + s) % m] = true;
        }
      }
    }
  }
  vector<int> pers(M + 1);
  for (int m = 1; m <= M; ++m) {
    vector<int> fail(m + 1);
    for (int f = fail[0] = -1, r = 0; r < m; ++r) {
      for (; ~f && B[m][f] != B[m][r]; f = fail[f]) {}
      fail[r + 1] = ++f;
    }
    const int per = m - fail[m];
    pers[m] = (m % per != 0) ? m : per;
  }
// for(int m=1;m<=11;++m){cerr<<"pers["<<m<<"] = "<<pers[m]<<", B["<<m<<"] = ";for(int r=0;r<m;++r)cerr<<B[m][r];cerr<<endl;}
  vector<int> es(M + 1, 0);
  for (int m = 1; m <= M; ++m) {
    for (int n = pers[m]; n > 1; ) {
      const int p = lpf[n];
      int e = 0;
      do { ++e; n /= p; } while (n % p == 0);
      chmax(es[p], e);
    }
  }
  Mint ans = 1;
  for (int p = 2; p <= M; ++p) if (lpf[p] == p) {
    ans *= Mint(p).pow(es[p]);
  }
  printf("%u\n", ans.x);
}
}  // solver


int N, M, SUB;
vector<int> A, B, C;

vector<vector<int>> G;
Scc scc;
vector<int> pot;

void dfsPot(int u) {
  for (const int i : G[u]) if (scc[A[i]] == scc[B[i]]) {
    const int v = B[i];
    if (!~pot[v]) {
      pot[v] = pot[u] + C[i];
      dfsPot(v);
    }
  }
}

vector<int> D;

/*
  0: cycle not used, find for all mod
  1: cycle used, find for gcd of cycles
*/
bitset<solver::M> vis[5010][2][solver::M + 1];

void dfs(int u, int s, int m, int r) {
  if (!vis[u][s][m][r]) {
    vis[u][s][m][r] = true;
    for (const int i : G[u]) {
      const int v = B[i];
      const int d = D[scc[v]];
      if (s || d) {
        if (s == 0 && m != d) continue;
        const int mm = __gcd(m, d);
        dfs(v, 1, mm, (r + C[i]) % mm);
      } else {
        dfs(v, 0, m, (r + C[i]) % m);
      }
    }
  }
}

int main() {
  for (; ~scanf("%d%d%d", &N, &M, &SUB); ) {
    A.resize(M);
    B.resize(M);
    C.resize(M);
    for (int i = 0; i < M; ++i) {
      scanf("%d%d%d", &A[i], &B[i], &C[i]);
      --A[i];
      --B[i];
    }
    
    G.assign(N, {});
    scc = Scc(N);
    for (int i = 0; i < M; ++i) {
      G[A[i]].push_back(i);
      scc.ae(A[i], B[i]);
    }
    scc.run();
    const auto uss = scc.group();
    pot.assign(N, -1);
    for (int x = 0; x < scc.l; ++x) {
      assert(!~pot[uss[x][0]]);
      pot[uss[x][0]] = 0;
      dfsPot(uss[x][0]);
      for (const int u : uss[x]) assert(~pot[u]);
    }
    D.assign(scc.l, 0);
    for (int i = 0; i < M; ++i) if (scc[A[i]] == scc[B[i]]) {
      const int x = scc[A[i]];
      D[x] = __gcd(D[x], abs(pot[A[i]] + C[i] - pot[B[i]]));
    }
// cerr<<"uss = "<<uss<<", D = "<<D<<endl;
    for (int x = 0; x < scc.l; ++x) {
      assert(0 <= D[x]); assert(D[x] <= solver::M);
    }
    
    for (int u = 0; u < N; ++u) for (int s = 0; s < 2; ++s) for (int m = 1; m <= solver::M; ++m) {
      vis[u][s][m].reset();
    }
    if (D[scc[0]]) {
      dfs(0, 1, D[scc[0]], 0);
    } else {
      for (int m = 1; m <= solver::M; ++m) {
        dfs(0, 0, m, 0);
      }
    }
    
    solver::init();
    for (int m = 1; m <= solver::M; ++m) {
      for (int r = 0; r < m; ++r) if (!vis[N - 1][1][m][r]) {
        solver::A[m][r] = true;
      }
    }
    solver::run();
#ifndef LOCAL
break;
#endif
  }
  return 0;
}