// what is matter? never mind. 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2") 
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
#define int long long
#define ull unsigned long long
#define SZ(x) ((int)((x).size()))
#define ALL(x) (x).begin(),(x).end()
using namespace std;
inline int read()
{
    char c=getchar();int x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}

#define mod 998244353
struct modint{
	int x;
	modint(int o=0){x=o;}
	modint &operator = (int o){return x=o,*this;}
	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint &operator -=(modint o){return x=x-o.x<0?x-o.x+mod:x-o.x,*this;}
	modint &operator *=(modint o){return x=1ll*x*o.x%mod,*this;}
	modint &operator ^=(int b){
		modint a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint &operator /=(modint o){return *this *=o^=mod-2;}
	friend modint operator +(modint a,modint b){return a+=b;}
	friend modint operator -(modint a,modint b){return a-=b;}
	friend modint operator *(modint a,modint b){return a*=b;}
	friend modint operator /(modint a,modint b){return a/=b;}
	friend modint operator ^(modint a,int b){return a^=b;}
	friend bool operator ==(modint a,int b){return a.x==b;}
	friend bool operator !=(modint a,int b){return a.x!=b;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
	bool operator <(const modint&b)const{return x<b.x;}
};
inline modint qpow(modint x,int y){return x^y;}

vector<modint> fac,ifac,iv;
inline void initC(int n)
{
	if(iv.empty())fac=ifac=iv=vector<modint>(2,1);
	int m=iv.size(); ++n;
	if(m>=n)return;
	iv.resize(n),fac.resize(n),ifac.resize(n);
	For(i,m,n-1){
		iv[i]=iv[mod%i]*(mod-mod/i);
		fac[i]=fac[i-1]*i,ifac[i]=ifac[i-1]*iv[i];
	}
}
inline modint C(int n,int m){
	if(m<0||n<m)return 0;
	return initC(n),fac[n]*ifac[m]*ifac[n-m];
}
inline modint sign(int n){return (n&1)?(mod-1):(1);}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;
 
#define maxn 1005
#define inf 0x3f3f3f3f

int n,m,k,res,O;
vi p[233];

void chk(){
//	For(x,1,k)For(i,0,n-1)cout<<p[x][i]<<" \n"[i==n-1];
	For(i,0,n-1){
		For(x,1,k)For(y,1,k){
			int t1=p[x][i]; t1=p[y][t1];
			int t2=p[y][i]; t2=p[x][t2];
			if(t1!=t2)return;
		}
	}
	res+=1;
	
}

void dfs(int u){
	if(u==k+1){
		chk();
		return;
	}
	For(i,0,n-1)p[u][i]=i;
	do{
		dfs(u+1);
	}while(next_permutation(ALL(p[u])));
}

int vis[maxn];

signed main()
{
	O=read(),n=read(),m=read(),k=read();
	initC(n+1);
	if(O>=5 && O<=6){
		cout<<fac[n].x;
		exit(0);
	}
	k+=m;
	For(i,1,k) p[i].resize(n);
	For(i,1,n*m){
		int u=read(),v=read(),w=read();
		p[w][u-1]=v-1;
	}
	if(m==1 && k==1){
		modint res=1;
		For(i,0,n-1) if(!vis[i]) {
			int len=0,u=i;
			while(!vis[u]) len++,vis[u]=1,u=p[1][u];
			res*=fac[len];
		}
		cout<<res.x;
		exit(0);
	}
	dfs(m+1);
	cout<<res;
	return 0;
}
/*
1 4 1 1
1 2 1
2 1 1
3 4 1
4 3 1

1 8 48 504 4680
*/