#include<bits/stdc++.h>
using namespace std;
constexpr int M=(1<<12)+5,mod=998244353;
int n,k,m,ans,a[13][13],res1[13][M],res2[M][M],res3[M][M],dp[13][M][M];
int read(){
    int x=0;char ch=getchar();
    while (!isdigit(ch)) ch=getchar();
    while (isdigit(ch)) x=x*10+ch-48,ch=getchar();
    return x;
}
int qpow(int x,int n){
    int s=1;while (n){
        if (n&1) s=1ll*s*x%mod;
        x=1ll*x*x%mod; n>>=1;
    } return s;
}
int rdc(int x){return x>=mod?x-mod:x;}
int main(){
    n=read();k=read();m=(1<<n)-1;
    for (int i=1;i<=n*(n-1);i++){
        int x=read(),y=read(),p=read(),q=read();
        a[x-1][y-1]=1ll*p*qpow(q,mod-2)%mod;
    }
    for (int i=0;i<n;i++)
        for (int sta=res1[i][0]=1;sta<=m;sta++){
            int low=sta&-sta,p=__builtin_ctz(sta);
            res1[i][sta]=1ll*res1[i][sta^low]*(mod+1-a[p][i])%mod;
        }
    for (int i=0;i<=m;i++)
        for (int sta=res2[i][0]=res3[i][0]=1;sta<=m;sta++){
            int low=sta&-sta,p=__builtin_ctz(sta);
            res2[i][sta]=1ll*res2[i][sta^low]*res1[p][i]%mod;
            res3[i][sta]=1ll*res3[i][sta^low]*(mod+1-res1[p][i])%mod;
        }
    dp[0][0][1]=1;
    for (int i=1;i<=k;i++){
        for (int s=1;s<=m;s++)
            for (int t=s;t;(--t)&=s){
                if (!dp[i-1][s^t][s]) continue;
                int sta=m^s;
                for (int p=sta;p;(--p)&=sta)
                    dp[i][s][s|p]=(dp[i][s][s|p]+1ll*dp[i-1][s^t][s]*res2[s^t][p]%mod*res3[t][p])%mod;
            }
        for (int j=1;j<=m;j++)
            ans=rdc(ans+dp[i][j][m]);
    }
    printf("%d\n",ans);
    return 0;
}