#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 = 1, x = Modint(M) * (M - 1);
    if(A[0] == A[1]) puts("0");
    else cout << x.val() << '\n';
    ans *= x--;
    ans *= x--;
    ans /= 2;
    for(int i = 2; i < N; i++){
        ans *= x--;
        cout << ans.val() << '\n';
    }
}