#include <stdio.h>

const int Mod = 998244353;

long long div_mod(long long x, long long y, long long z)
{
	if (x % y == 0) return x / y;
	else return (div_mod((1 + x / y) * y - x, (z % y), y) * z + x) / y;
}

int main()
{
	int i, N, M, B[100001], C[100001];
	scanf("%d %d", &N, &M);
	for (i = 1; i <= N; i++) scanf("%d %d", &(B[i]), &(C[i]));
	
	int j;
	long long d_fact[3] = {(long long)M * (M - 1) % Mod, (long long)M * (M - 1) % Mod - 1, 1}, tmp = d_fact[0] - 2;
	printf("1\n");
	if (B[0] == B[1] && C[0] == C[1]) printf("0\n");
	else printf("%lld\n", d_fact[0]);
	for (i = 2, j = 0, d_fact[0] = d_fact[0] * div_mod(1, 2, Mod) % Mod; i < N; i++, j ^= 1) {
		d_fact[j] = d_fact[j] * (tmp--) % Mod;
		if (tmp < 0) tmp += Mod;
		if (j == 0) printf("%lld\n", d_fact[0] * d_fact[1] % Mod);
		else {
			d_fact[2] = d_fact[2] * (Mod - i) % Mod;
			printf("%lld\n", d_fact[0] * (d_fact[1] + d_fact[2]) % Mod);
		}
	}
	fflush(stdout);
	return 0;
}