#include <bits/stdc++.h>
using namespace std;
const int N=55,M=1e4+5;
#pragma GCC optimize("Ofast","inline","-ffast-math")
#pragma GCC target("avx,sse2,sse3,sse4,mmx")
inline int read(){
	int x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9')x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
	return x*f;
}
int n,m;
double jie[M],inv[M],f[N][M][2],g[N][M][N][2];
int main(){
	// freopen(".in","r",stdin);
	// freopen(".out","w",stdout);
	n=read(),m=read();
	jie[0]=inv[0]=1;
	for(int i = 1;i<=n;i++)jie[i]=jie[i-1]*i,inv[i]=inv[i-1]/i;
	f[0][0][1]=jie[n];
	for(int i = 0;i<=n;i++){
		for(int j = i;j<=m;j++){
			if(f[i][j]==0)continue;
			if(i&&i+j<=m){
				f[i][i+j][1]=(f[i][i+j][1]+f[i][j][0]+f[i][j][1]);
				for(int k = 1;k<=i;k++)g[i][j+i][k][1]=(g[i][i+j][k][1]+g[i][j][k][0]+f[i][j][0]+g[i][j][k][1]+f[i][j][1]);
			}
			for(int l = 1;l+i<=n;l++){
				double w=f[i][j][1]*inv[l];
				f[i+l][j+l][0]=(f[i+l][j+l][0]+w);
				for(int k = i+1;k<=i+l;k++)g[i+l][j+l][k][0]=(g[i+l][j+l][k][0]+w);
			}
			for(int k = 1;k<=i;k++){
				for(int l = 1;l+i<=n;l++)g[i+l][j+l][k][0]=(g[i+l][j+l][k][0]+g[i][j][k][1]*inv[l]);
			}
		}
	}
	long double ans=0,val=0;
	for(int i = n;i<=m;i++){
		long double now = 1;
		for(int j = n;j<=i-1;j++)now*=j*1.0/(j-n+1);
		val+=now;
	}
	for(int i = n;i>=1;i--){
		for(int j = n;j<=m;j++){
			ans=(ans+g[n][j][i][0]+g[n][j][i][1]);
			// if(i==n)cout<<"!"<<j<<' '<<i<<' '<<g[n][j][i][0]+g[n][j][i][1]<<endl;
		}
		// cerr<<ans<<' '<<val<<endl;
		printf("%.7Lf\n",ans/val);
	}
	return 0;
}