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

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