#include <iostream>
#include <cstdio>

using namespace std;

const int N = 12, M = 540000, P = 998244353, T = 15718440;

typedef long long LL;

int n, K, f[N][M], a[M], b[M], tot, s;

int id[1 << N][1 << N];

int U[T], V[T], W[T], len;

int A[1 << N][N], B[1 << N][N];

int p[N][N], q[N][N];

void inline out(int x) {
	for (int i = 0; i < n; i++)
		printf("%d", x >> i & 1);
}

int inline power(int a, int b) {
	int res = 1;
	while (b) {
		if (b & 1) res = (LL)res * a % P;
		a = (LL)a * a % P;
		b >>= 1;
	}
	return res;
}

int main() {
	scanf("%d%d", &n, &K); s = (1 << n) - 1;
	for (int i = 1; i <= n * (n - 1); i++) {
		int x, y, u, v; scanf("%d%d%d%d", &x, &y, &u, &v);
		--x, --y; p[x][y] = u, q[x][y] = v;
	}
	
	
	int o = 0;
	for (int j = 0; j < n; j++) A[0][j] = B[0][j] = 1;
	for (int i = 1; i < (1 << n); i++) {
		for (int j = i; j; j = (j - 1) & i) {
			a[++tot] = i, b[tot] = j;
			id[i][j] = tot;
		}
		for (int j = 0; j < n; j++) {
			if (i >> j & 1) continue;
			A[i][j] = 1;
			for (int k = 0; k < n; k++) {
				if (i >> k & 1) {
					A[i][j] = (LL)A[i][j] * (q[k][j] - p[k][j]) % P * power(q[k][j], P - 2) % P;
				}
			}
			B[i][j] = (1ll + P - A[i][j]) % P;
			
		}
	}
	//cout << (LL)A[1][1] * 2 % P << " " << A[1][2] * 3ll % P << endl;
	
	for (int i = 1; i < (1 << n); i++) {
		for (int j = i; j; j = (j - 1) & i) {
			int u = id[i][j], b = s ^ i, w = i ^ j;
			//cout << u << " ??? " << i << " " << j << endl;
			for (int k = b; k; k = (k - 1) & b) {
				int v = id[i ^ k][k];
				++len; W[len] = 1;
				for (int c = 0; c < n; c++) {
					if (k >> c & 1) {
						W[len] = (LL)W[len] * A[w][c] % P * B[j][c] % P;
						//cout << " orz " << c << " " << w << " " << j << " " << A[w][c] << " " << B[j][c] << endl;
					}
				}
				U[len] = u, V[len] = v;
				//cout << " trans st" << (i ^ k) << " "  << u << " " << v << " " << W[len] << endl;
			}
		}
	}
	
	
	//cout << o << endl;
	f[0][1] = 1;
	for (int k = 1; k <= K; k++) {
		for (int i = 1; i <= len; i++) {
			if (!f[k - 1][U[i]]) continue;
			f[k][V[i]] = (f[k][V[i]] + (LL)f[k - 1][U[i]] * W[i]) % P;
		}
		
	}
	int ans = 0;
	for (int i = 1; i <= tot; i++) 
		if (a[i] == s) {
			for (int j = 0; j <= K; j++)
				(ans += f[j][i]) %= P;
		}
	printf("%d\n", ans);
	return 0;
}