#include <bits/stdc++.h>

using namespace std;

#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)

const int nmax=55;
const int mmax=10005;

using ld=long double;

ld bin[nmax][nmax];
ld dp[nmax][mmax],eq[nmax][mmax];
ld ans[mmax];

void slv(){
	int n,m;cin>>n>>m;
	m-=n;
	
	bin[0][0]=1;
	rep(i,n+1)rep(j,n+1){
		if(i)bin[i][j]+=bin[i-1][j];
		if(j)bin[i][j]+=bin[i][j-1];
	}
	rep(i,n+1)rep(j,n+1){
		rep(k,j){
			bin[i][j]*=(i+k+1);
			bin[i][j]/=(m+n)-(i+k);
		}
	}
	
	rng(i,1,n+1)dp[i][0]=bin[0][i];
	rng(i,1,n+1)rep(j,m-i+1){
		rng(k,i,n+1){
			dp[k][j+i]+=dp[i][j]*bin[i][k-i];
		}
	}
	rep(i,m+1)eq[n][i]=1;
	gnr(i,1,n+1)per(j,m-i+1){
		rng(k,i,n+1){
			eq[i][j]+=eq[k][j+i]*bin[i][k-i];
		}
	}
	rng(i,1,n+1)rep(j,m-i+1){
		ld w=0;
		rng(k,i,n+1){
			w+=eq[k][j+i]*bin[i][k-i];
		}
		ans[n-i]+=w*dp[i][j];
	}
	rep(i,n-1)ans[i+1]+=ans[i];
	rep(i,n)ans[i]+=1;
	rep(i,n-1)ans[i+1]+=ans[i];
	
	rep(i,n)cout<<ans[i]<<endl;
}

signed main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(20);
	
	slv();
}