#include <bits/stdc++.h>


#define MOD 998244353
#define inv3 332748118


using namespace std;


struct Node {
	int x[2], y[2];
} a0;


int m;
long long ans;


struct {
	int n = 0, nx, ny;
	Node a[509];
	int arrx[509], arry[509], dis[509][509];
	vector<int> b[509][509];

	void init() {
		sort(a + 1, a + n + 1, [](const Node &i, const Node &j) {return i.x[0] == j.x[0] ? i.y[0] > j.y[0] : i.x[0] > j.x[0];});
		for (int i = 1; i <= n; ++ i) arrx[i] = a[i].x[1], arry[i] = a[i].y[1];
		arrx[0] = 1, arrx[n + 1] = m + 1, arry[0] = 1, arry[n + 1] = m + 1;
		sort(arrx + 1, arrx + n + 1);
		sort(arry + 1, arry + n + 1);
		nx = unique(arrx, arrx + n + 2) - arrx - 1;
		ny = unique(arry, arry + n + 2) - arry - 1;
		memset(dis, 0xc0, sizeof(dis));
		for (int i = 1; i <= n; ++ i) dis[i][i] = 0;
		for (int i = 1; i <= n; ++ i)
			for (int j = 1; j <= n; ++ j)
				if (a[i].x[0] >= a[j].x[1] && a[i].y[0] >= a[j].y[1])
					dis[i][j] = 1;
		for (int k = 1; k <= n; ++ k)
			for (int i = 1; i <= n; ++ i)
				for (int j = 1; j <= n; ++ j)
					dis[i][j] = max(dis[i][j], dis[i][k] + dis[k][j]);
		for (int i = 1; i <= n; ++ i)
			b[lower_bound(arrx, arrx + nx + 1, a[i].x[1]) - arrx][lower_bound(arry, arry + ny + 1, a[i].y[1]) - arry].push_back(i);
	}

	vector<int> vec_row, vec_col[509];
	int f[509], h[509];

	inline void update(int u) {
		vec_row.push_back(u);
		for (auto i : vec_row) f[i] = max(f[i], dis[u][i]);
	}

	void solve() {
		init();
		for (int i = 0; i < nx; ++ i) {
			vec_row.clear();
			memset(f, -1, sizeof(f));
			for (int j = 0; j < ny; ++ j) {
				for (auto k : b[i][j]) vec_col[j].push_back(k);
				for (auto k : vec_col[j]) update(k);
				const long long temp = (long long)(arrx[i + 1] - arrx[i]) * (arry[j + 1] - arry[j]) % MOD;
				if (!temp) continue;
				memset(h, 0, sizeof(h));
				int sum_area = 0;
				for (int k = 1; k <= n; ++ k) {
					const int d = f[k];
					if (d == -1 || h[d] >= a[k].y[0]) continue;
					sum_area += (a[k].y[0] - h[d]) * a[k].x[0];
					h[d] = a[k].y[0];
				}
				(ans = (ans - sum_area * temp) % MOD) < 0 ? ans += MOD, void() : void();
			}
		}
	}
} task[2];


int main() {
	int n;
	scanf("%d %d", &n, &m);
	ans = (long long)(m - 1) * (m + 1) % MOD * m % MOD * m % MOD * m % MOD * inv3 % MOD;
	for (int i = 1; i <= n; ++ i) {
		scanf("%d %d %d %d", &a0.x[0], &a0.y[0], &a0.x[1], &a0.y[1]);
		if (a0.y[0] < a0.y[1]) task[0].a[++ task[0].n] = a0;
		else task[1].a[++ task[1].n] = {{m - a0.x[1] + 1, m - a0.x[0] + 1}, {a0.y[1], a0.y[0]}};
	}
	task[0].solve(), task[1].solve();
	printf("%lld", ans);
	return 0;
}