#include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define pii pair<ll,ll>
#define rep(i,a,b) for(ll i=(a);i<=(b);++i)
#define per(i,a,b) for(ll i=(a);i>=(b);--i)
using namespace std;
bool Mbe;
inline ll read(){
	ll x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-f;ch=getchar();}
	while(ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();
	return x*f;
}
inline void write(ll x){
	if(x<0)putchar('-'),x=-x;
	if(x>9)write(x/10);
	putchar(x%10+'0');
}
const ll N=4e6+9,O=5e5+9,Mod=998244353,G=3,invG=332748118,inv2=(Mod+1)>>1;
ll n,X,fac[N],ifac[N],inv[N],cat[O],q1[O],q2[O];
ll pw(ll x,ll p){
	ll res=1;
	while(p){
		if(p&1)res=res*x%Mod;
		x=x*x%Mod;
		p>>=1;
	}
	return res;
}
void Init(ll n){
	fac[0]=1;
	rep(i,1,n)fac[i]=fac[i-1]*i%Mod;
	ifac[n]=pw(fac[n],Mod-2);
	per(i,n-1,0)ifac[i]=ifac[i+1]*(i+1)%Mod;
	rep(i,1,n)inv[i]=ifac[i]*fac[i-1]%Mod;
}
ll C(ll x,ll y){
	if(x<y||y<0)return 0;
	return fac[x]*ifac[y]%Mod*ifac[x-y]%Mod;
}
namespace Poly{
	struct poly{
		vector<ll>a;
		ll size()const{return a.size();}
		void resize(ll n){a.resize(n);}
		ll operator[](ll n)const{return a[n];}
		ll &operator[](ll n){return a[n];}
	};
	ll r[N];
	ll init(ll n){
		ll p=1,c=0;
		while(p<=2*n)p<<=1,c++;
		r[0]=0;
		rep(i,1,p-1)r[i]=(r[i>>1]>>1)|((i&1)<<(c-1));
		return p;
	}
	void NTT(poly&a,ll n,ll sgn){
		rep(i,0,n-1){
			if(i<r[i])swap(a[i],a[r[i]]);
		}
		for(ll mid=1;mid<n;mid<<=1){
			ll wn=pw(sgn==1?G:invG,(Mod-1)/(mid<<1)),R=(mid<<1);
			for(ll j=0;j<n;j+=R){
				ll w=1;
				rep(k,0,mid-1){
					ll x=a[j+k],y=a[j+k+mid]*w%Mod;
					a[j+k]=(x+y)%Mod;
					a[j+k+mid]=(x-y+Mod)%Mod;
					w=w*wn%Mod;
				}
			}
		}
		if(~sgn)return ;
		ll inv=pw(n,Mod-2);
		rep(i,0,n-1)a[i]=a[i]*inv%Mod;
	}
	poly tmp1,tmp2;
	poly operator*(const poly&a,const ll&b){
		poly c;
		rep(i,0,(ll)a.size()-1)c[i]=a[i]*b%Mod;
		return c;
	}
	poly operator*(const poly&a,const poly&b){
		ll p=init(a.size()+b.size());
		tmp1=a,tmp2=b;
		tmp1.resize(p),tmp2.resize(p);
		NTT(tmp1,p,1);
		NTT(tmp2,p,1);
		rep(i,0,p-1)tmp1[i]=tmp1[i]*tmp2[i]%Mod;
		NTT(tmp1,p,-1);
		tmp1.resize(a.size()+b.size());
		return tmp1;
	}
}
using namespace Poly;
ll Catk(ll n,ll k){
	if(n<0||k<0)return 0;
	return k*inv[n+k]%Mod*C(2*n+k-1,n)%Mod;
}
bool Med;
int main(){
	cerr<<fabs(&Med-&Mbe)/1048576.0<<"MB\n";
	n=read(),X=read();
	Init(2e6);
	cat[0]=1;
	rep(i,1,n)cat[i]=inv[i+1]*C(2*i,i)%Mod;
	//size
	poly f,g;f.resize(X),g.resize(n-X+1);
	rep(i,0,X-1)f[i]=cat[i];
	rep(i,0,n-X)g[i]=cat[i];
	f=f*g;
	rep(i,1,n)q1[i]=f[i-1]*cat[n-i]%Mod;
	per(i,n,0)q1[i]=(q1[i+1]+q1[i])%Mod;
	f.a.clear(),g.a.clear();
	f.resize(n+1),g.resize(n+1);
	//dep
	rep(i,0,n)f[i]=Catk(X-i-1,i+1)*ifac[i]%Mod;
	rep(i,0,n)g[i]=Catk(n-i-X,i+1)*ifac[i]%Mod;
	f=f*g;
	rep(i,1,n)q2[i]=f[i-1]*fac[i-1]%Mod;
	per(i,n,0)q2[i]=(q2[i]+q2[i+1])%Mod;
    rep(i,1,n)write(((cat[n]-q1[n-i+2]-q2[i+1])%Mod+Mod)%Mod),putchar('\n');
    return 0;
}