#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#include <atcoder/all>
#define popcount __builtin_popcount
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<ll, int> P;
using mint=modint998244353;
ll powmod(ll a, ll k, ll MOD){
    ll ap=a, ans=1;
    while(k){
        if(k&1){
            ans*=ap;
            ans%=MOD;
        }
        ap=ap*ap;
        ap%=MOD;
        k>>=1;
    }
    return ans;
}
ll inv(ll a, ll MOD){
    return powmod(a, MOD-2, MOD);
}
mint f[2000010], invf[2000010];
void fac(int n){
    f[0]=1;
    for(ll i=1; i<=n; i++) f[i]=f[i-1]*i;
    invf[n]=f[n].inv();
    for(ll i=n-1; i>=0; i--) invf[i]=invf[i+1]*(i+1);
}
mint comb(int x, int y){
    if(!(0<=y && y<=x)) return 0;
    return f[x]*invf[y]*invf[x-y];
}
int b[100010], c[100010];
int s[100010];
int main()
{
    int n, m;
    cin>>n>>m;
    for(int i=0; i<n; i++) cin>>b[i]>>c[i];
    for(int i=0; i<n; i++){
        s[i+1]=s[i];
        if(m>=3){
            if(powmod(c[i], (m-1)/2, m)==m-1) s[i+1]^=1;
        }else{
            if(b[i]==1) s[i+1]^=1;
        }
    }
    mint l=mint(m)*mint(m-1)/mint(2);
    vector<mint> v(n+1), v0(n+1), v1(n+1);
    v[0]=1;
    for(int i=1; i<=n; i++){
        v[i]=v[i-1]*mint(l-i+1)/mint(i);
        //cout<<v[i].val()<<endl;
    }
    for(int i=0; i<=n; i++){
        if(i&1) v1[i]=v[i];
        else v0[i]=v[i];
    }
    auto c0=convolution(v0, v), c1=convolution(v1, v);
    fac(n);
    for(int i=1; i<=n; i++){
        if(i==1){
            cout<<1<<endl;
            continue;
        }
        if(i==2){
            if(b[0]==b[1] && c[0]==c[1]) cout<<0<<endl;
            else cout<<(l*2).val()<<endl;
            continue;
        }
        if(m==2){
            cout<<0<<endl;
        }else{
            if(s[i]==0) cout<<(c0[i]*f[i]).val()<<endl;
            else cout<<(c1[i]*f[i]).val()<<endl;
        }
    }
    return 0;
}