#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace std;
using Modint = atcoder::modint998244353;
using Modint2 = atcoder::modint;

int main(){
    int N, M;
    cin >> N >> M;
    vector<pair<int, int>> A(N);
    for(auto& [B, C] : A) cin >> B >> C;
    cout << 1 << '\n';
    Modint ans = Modint(2).inv(), ans2 = Modint(2).inv(), x = Modint(M) * (M - 1), y = x / 2;
    Modint2::set_mod(M);
    Modint2 z = 1;
    if(A[0] == A[1]) cout << 0 << '\n';
    else cout << x.val() << '\n';
    ans *= x--;
    z *= A[0].second;
    ans *= x--;
    z *= A[1].second;
    ans2 *= 2;
    ans2 *= y--;
    for(int i = 3; i <= N; i++){
        ans *= x--;
        z *= A[i - 1].second;
        ans2 *= Modint::raw(i);
        if(i % 2 == 0){
            ans2 *= y--;
            ans2 /= Modint::raw(i / 2);
            if((z.pow(M / 2) == 1) ^ (i >> 1 & 1)) cout << (ans + ans2).val() << '\n';
            else cout << (ans - ans2).val() << '\n';
        }
        else cout << ans.val() << '\n';
    }
}