#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define ll long long
#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
using namespace std;
const int N = 12,M = 1<<N,mod = 998244353;
int n,k,up;
ll e[N][N],f[M][M],s[M][M],ans;
ll inv(ll x){return x <= 1?1:mod-mod/x*inv(mod%x)%mod;}
char buf[1<<21],*p1,*p2;
inline int rd()
{
    char c;int f = 1;
    while(!isdigit(c = getchar()))if(c=='-')f = -1;
    int x = c-'0';
    while(isdigit(c = getchar()))x = x*10+(c^48);
    return x*f;
}
int main()
{
    // freopen("1.in","r",stdin);
    // freopen(".out","w",stdout);
    n = rd();k = rd();up = (1<<n)-1;
    for(int i = 1;i <= n*(n-1);i++)
    {
        int x = rd()-1,y = rd()-1;
        ll p = rd(),q = rd();
        e[x][y] = p*inv(q)%mod;
    }
    for(int i = 1;i <= up;i++)for(int j = 1;j <= up;j++)
        if(!(i&j))
        {
            s[i][j] = 1;
            for(int q = 0;q < n;q++)if(j>>q&1)
            {
                ll sum = 1;
                for(int p = 0;p < n;p++)if(i>>p&1)
                    (sum *= 1-e[p][q]) %= mod;
                (s[i][j] *= 1-sum+mod) %= mod;
            }
        }
        else if((i&j) == i)
        {
            s[i][j] = 1;
            for(int p = 0;p < n;p++)if(i>>p&1)
                for(int q = 0;q < n;q++)if(!(j>>q&1))
                    (s[i][j] *= 1-e[p][q]+mod) %= mod;
        }
    f[1][1] = 1;
    while(k--)
    {
        for(int i = up;i;i--)for(int j = i;j;j = i&(j-1))if(f[i][j])
        {
            ll now = f[i][j];
            for(int k = up^i,l = k;l;l = k&(l-1))
                (f[i|l][l] += now*s[j][l]%mod*s[j][i|l]) %= mod;
                // f[i][j] = (f[i][j]+f[k][l]*s[l][i]%mod*s[l][j])%mod;
            // f[i][j] = 0;
            f[i][j] = 0;
        }
        for(int j = 1;j <= up;j++)
            (ans += f[up][j]) %= mod;
    }
    cout << ans << endl;
    return 0;
}