#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=(1<<20)+5,M=(1<<20)+5,K=1000+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(263082);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n,x,k;ll A[N],B[N],frc[N],inv[N];
ll mpow(ll x,int y=mod-2){ll ans=1;while(y) y&1&&(ans=ans*x%mod),y>>=1,x=x*x%mod;return ans;}
namespace poly{
	int tr[N];ll pw[N];const int g=3;
	void init(int n){
		for(k=2;k<=n;k<<=1);
		for(int i=0;i<k;i++) tr[i]=(tr[i>>1]>>1)|(i&1?k/2:0);
		pw[k/2]=1;pw[k/2+1]=mpow(g,(mod-1)/k);
		for(int i=k/2+2;i<k;i++) pw[i]=pw[i-1]*pw[k/2+1]%mod;
		for(int i=k/2-1;i;i--) pw[i]=pw[i<<1];
	}
	void ntt(ll *A,int k,int flag){
		static ull a[N];for(int i=0;i<k;i++) a[tr[i]]=A[i];
		for(int i=2;i<=k;i<<=1){
			ll *e=pw+i/2;
			for(int j=0;j<k;j+=i) for(int h=j;h<j+i/2;h++){
				ull y=a[h+i/2]*e[h-j]%mod;
				a[h+i/2]=a[h]+mod-y;a[h]+=y;
			}
			if(i==(1<<18)){
				for(int j=0;j<k;j++) a[j]%=mod;
			}
		}
		for(int i=0;i<k;i++) A[i]=a[i]%mod;
		if(flag) return;
		reverse(A+1,A+k);
		ll iv=mpow(k);for(int i=0;i<k;i++) A[i]=A[i]*iv%mod;
	}
}
void mul(ll *A,ll *B){
	// static ll C[N];Me(C,0);
	poly::init(n+1);
	poly::ntt(A,k,1);poly::ntt(B,k,1);
	for(int i=0;i<k;i++) A[i]=A[i]*B[i]%mod;
	poly::ntt(A,k,0);
	// for(int i=0;i<=n;i++) for(int j=0;i+j<=n;j++) C[i+j]+=A[i]*B[j]%mod;
	// for(int i=0;i<=n;i++) A[i]=C[i]%mod;
}
ll ans[N],f[N],g[N];
ll C(int x,int y){return x>=y&&y>=0?frc[x]*inv[y]%mod*inv[x-y]%mod:0;}
ll calc(int x){return (C(2*x,x)-C(2*x,x+1)+mod)%mod;}
ll Go(int d,int n){
	int tx=2*n-(d+1),ty=d-1;
	return (C(tx,tx+ty>>1)-C(tx,tx+2*-1-ty>>1)+mod)%mod;
}
void Solve(){
	int i,j;scanf("%d%d",&n,&x);
	inv[1]=1;for(i=2;i<=2*n;i++) inv[i]=(mod-inv[mod%i])*(mod/i)%mod;
	for(frc[0]=inv[0]=i=1;i<=2*n;i++) frc[i]=frc[i-1]*i%mod,inv[i]=inv[i-1]*inv[i]%mod;
	gdb(Go(2,1));
	for(i=1;i<=n;i++) f[i-1]=Go(i,x)*inv[i-1]%mod,g[i-1]=Go(i,n-x+1)*inv[i-1]%mod;
	mul(f,g);
	for(i=0;i<=n;i++) ans[i+1]+=f[i]*frc[i]%mod;
	Me(f,0);Me(g,0);
	for(i=0;i<x;i++) f[i]=calc(i);for(i=0;i<=n-x;i++) g[i]=calc(i);
	mul(f,g);
	for(i=0;i<=n;i++) ans[n-i+1]-=f[i]*calc(n-i-1)%mod;
	for(i=1;i<=n;i++) ans[i]=((ans[i-1]+ans[i])%mod+mod)%mod,printf("%lld\n",ans[i]);
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}