#include using namespace std; using ll = long long; template using vec = vector; template using vvec = vector>; constexpr ll mod = 1e9+7; struct mint { ll x; mint(ll x=0):x((x%mod+mod)%mod){} friend ostream &operator<<(ostream& os,const mint& a){ return os << a.x; } friend istream &operator>>(istream& is,mint& a){ ll t; is >> t; a = mint(t); return (is); } mint& operator+=(const mint a) { if ((x += a.x) >= mod) x -= mod; return *this; } mint& operator-=(const mint a) { if ((x += mod-a.x) >= mod) x -= mod; return *this; } mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this; } mint operator+(const mint a) const { mint res(*this); return res+=a; } mint operator-(const mint a) const { mint res(*this); return res-=a; } mint operator*(const mint a) const { mint res(*this); return res*=a; } mint pow(ll t) const { if (!t) return 1; mint a = pow(t>>1); a *= a; if (t&1) a *= *this; return a; } // for prime mod mint inv() const { return pow(mod-2); } mint& operator/=(const mint a) { return (*this) *= a.inv(); } mint operator/(const mint a) const { mint res(*this); return res/=a; } }; constexpr int X = 216; using mat = array,X>; mat mult(mat& A,mat& B){ mat C{}; for(int i=0;i>1,e); R = mult(R,R); if(n&1) R = mult(A,R); return R; } int main(){ cin.tie(0); ios::sync_with_stdio(false); ll K,M,N; cin >> K >> M >> N; vec P(M),Q(M),R(M); for(int i=0;i> P[i] >> Q[i] >> R[i]; } if(N==3){ int ans = 0; for(int i=0;i