#include<bits/stdc++.h>
using namespace std;
#define ll long long
namespace IO{//by cyffff
	int len=0;
	char ibuf[(1<<21)+1],*iS,*iT,out[(1<<25)+1];
	#if ONLINE_JUDGE
	#define gh() (iS==iT?iT=(iS=ibuf)+fread(ibuf,1,(1<<21)+1,stdin),(iS==iT?EOF:*iS++):*iS++)
 	#else
	#define gh() getchar()
	#endif
	#define reg register
	inline int read(){
		reg char ch=gh();
		reg int x=0;
		reg char t=0;
		while(ch<'0'||ch>'9')   t|=ch=='-',ch=gh();
		while(ch>='0'&&ch<='9') x=x*10+(ch^48),ch=gh();
		return t?-x:x;
	}
	inline void putc(char ch){
		out[len++]=ch;
	}
	template<class T>
	inline void write(T x){
		if(x<0)putc('-'),x=-x;
		if(x>9)write(x/10);
		out[len++]=x%10+48;
	}
	inline void flush(){
		fwrite(out,1,len,stdout);
		len=0;
	}
	inline char getc(){
		char ch=gh();
		while(ch<'A'||ch>'Z') ch=gh();
		return ch;
	}
}
using IO::read;
using IO::write;
using IO::flush;
using IO::getc;
using IO::putc;
#define pii pair<int,int>
#define mpr make_pair
#define fir first
#define sec second
const int N=12+2,S=1<<12,mod=998244353;
inline int add(int a,int b){ return a+b>=mod?a+b-mod:a+b; }
inline int dec(int a,int b){ return a>=b?a-b:a+mod-b; }
inline void inc(int &a,int b){ a=a+b>=mod?a+b-mod:a+b; }
inline int qpow(int x,int y){
	int res=1;
	while(y){
		if(y&1) res=1ll*res*x%mod;
		x=1ll*x*x%mod;
		y>>=1;
	}
	return res;
}
int n,u,k,w[N][N],f[2][S][S],ci[S][S],ic[S][S],ip[N],ans;
int main(){
	n=read(),k=read(),u=1<<n;
	for(int c=1;c<=n*(n-1);c++){
		int i=read()-1,j=read()-1,x=read(),y=read();
		w[i][j]=1ll*x*qpow(y,mod-2)%mod;
	}
	for(int s=1;s<u;s++){
		for(int i=0;i<n;i++){
			if(s>>i&1) continue;
			int tp=1;
			for(int j=0;j<n;j++)
				if(s>>j&1)
					tp=1ll*tp*dec(1,w[j][i])%mod;
			ip[i]=dec(1,tp);
		}
		for(int rs=(u-1)^s,r=rs;r;r=(r-1)&rs){
			int tp1=1,tp2=1;
			for(int i=0;i<n;i++)
				if(r>>i&1) 
					tp1=1ll*tp1*ip[i]%mod,
					tp2=1ll*tp2*dec(1,ip[i])%mod;
			ci[s][r]=tp1,ic[s][r]=tp2;
		}
		ic[0][s]=1;
	}
	f[0][1][1]=1;
	for(int d=1,c=0;d<=k;d++,c^=1){
		for(int s=1;s<u;s+=2)
			for(int t=s,rs=(u-1)^s;t;t=(t-1)&s){
				int v=f[c][s][t];
				if(!v) continue;
				for(int r=rs;r;r=(r-1)&rs)
					inc(f[!c][s^r][r],1ll*v*ci[t][r]%mod*ic[s^t][r]%mod);
				f[c][s][t]=0;
			}
		for(int t=0;t<u;t++)
			inc(ans,f[c^1][u-1][t]);
	}
	write(ans);
	flush();
}