#include<bits/stdc++.h>
using std::cin;
using std::cout;
using ll = long long;
using u64 = unsigned long long;
void IOinit() {
	std::ios::sync_with_stdio(false), cin.tie(0);
#ifdef zqj
	freopen("1.in", "r", stdin);
#endif
}
struct vec3 {
	int x, y, z;
	bool operator < (const vec3 & rhs) const {
		if(x != rhs.x) return x < rhs.x;
		if(y != rhs.y) return y < rhs.y;
		return z < rhs.z;
	}
};
ll K;
struct plane {
	vec3 x; int v;
};
vec3 operator - (vec3 x, vec3 y) { return {x.x - y.x, x.y - y.y, x.z - y.z}; }
vec3 operator + (vec3 x, vec3 y) { return {x.x + y.x, x.y + y.y, x.z + y.z}; }
int operator % (vec3 x, vec3 y) { return x.x * y.x + x.y * y.y + x.z * y.z; }
vec3 operator * (vec3 x, vec3 y) {
	return {
		x.y * y.z - x.z * y.y,
		x.z * y.x - x.x * y.z,
		x.x * y.y - x.y * y.x
	};
}
int n;
ll calc(std::vector<plane> p, int k) {
	for(auto & [v, z] : p) {
		z *= k;
	}
	const int V = k * 200;
	ll sum = 0;
	for(int x = -V;x <= V;++x) {
		for(int y = -V;y <= V;++y) {
			int minz = -V, maxz = V;
			for(auto [v, z] : p) {
				z -= v.x * x + v.y * y;
				if(v.z == 0) {
					if(z < 0) {
						minz = 1, maxz = 0;
					}
				} else if(v.z > 0) { // v.z * Z <= z
					for(;minz <= maxz && v.z * maxz > z;) {
						-- maxz;
					}
				} else { 
					for(;minz <= maxz && v.z * minz > z;) {
						++ minz;
					}
				}
				if(minz > maxz) break;
			}
			sum += maxz - minz + 1;
		}
	}
	return sum;
}
int main() {
	IOinit();
	cin >> n >> K;
	std::vector<vec3> a(n);
	std::vector<plane> p;
	std::set<vec3> set;
	for(auto & [x, y, z] : a) {
		cin >> x >> y >> z;
	}
	for(int i = 0;i < n;++i) {
		for(int j = i + 1;j < n;++j) {
			for(int k = i + 1;k < n;++k) if(i != j) {
				vec3 x = a[j] - a[i];
				vec3 y = a[k] - a[i];
				vec3 z = x * y;
				if(z.x || z.y || z.z) {
					int gcd = std::gcd(std::gcd(z.x, z.y), z.z);
					z.x /= gcd;
					z.y /= gcd;
					z.z /= gcd;
					int v = z % a[i], ok = 1;
					for(int l = 0;l < n;++l) {
						ok = ok && z % a[l] <= v;
					}
					if(ok) {
						if(set.count(z)) {
							continue;
						}
						set.emplace(z);
						p.push_back({z, v});
					}
				}
			}
		}
	}
	ll v[4] = { 1, calc(p, 1), calc(p, 2), calc(p, 3) };
	const int mod = 998244353;
	K %= mod;
	ll ans = 0;
	for(int i = 0;i < 4;++i) {
		ll mul = 1;
		for(int j = 0;j < 4;++j) if(j != i) {
			mul = mul * (K - j) % mod;
			for(;mul % (i - j);) mul += mod;
			mul /= i - j;
		}
		ans += mul % mod * v[i];
	}

	ans %= mod;
	ans += mod;
	ans %= mod;

	cout << ans << '\n';
}