#include <cstdio>
#include <cstring>
#include <algorithm>
#define FILEIO(filename) (freopen(filename ".in", "r", stdin), freopen(filename ".out", "w", stdout))
typedef long long ll;
const int N = 55, M = 10005;
int n, m;
ll binom[N][N];
long double tr[N][N], f[N][M], g[N][M], sum[N];
int main(void)
{
	scanf("%d%d", &n, &m);
	for(int i = 0;i <= n;++i)
	{
		binom[i][0] = 1;
		for(int j = 1;j <= i;++j)
			binom[i][j] = binom[i - 1][j] + binom[i - 1][j - 1];
	}
	for(int i = 0;i <= n;++i)
		for(int j = i;j <= n;++j)
		{
			tr[i][j] = binom[j][i];
			for(int k = i + 1;k <= j;++k)
				tr[i][j] = tr[i][j] * k / (m - k + 1);
		}
	f[0][0] = 1;
	for(int i = 0;i <= n;++i)
		for(int j = std::max(i, 1);j <= n;++j)
			for(int k = 0;k <= m - j;++k)
				f[j][k + j] += tr[i][j] * f[i][k];
	for(int i = 0;i <= m;++i)
		g[n][i] = 1;
	for(int i = n;i >= 0;--i)
		for(int j = i;j > 0;--j)
			for(int k = m;k >= i;--k)
				g[j][k - i] += tr[j][i] * g[i][k];
	for(int i = 1;i <= n;++i)
		for(int j = 0;j <= m;++j)
			sum[i] += f[i][j] * g[i][j];
	for(int i = n;i >= 1;--i)
		sum[i] += sum[i + 1];
	std::reverse(sum + 1, sum + 1 + n);
	for(int i = 1;i <= n;++i)
		sum[i] += sum[i - 1];
	for(int i = 1;i <= n;++i)
		printf("%.9Lf%c", sum[i], " \n"[i == n]);
	return 0;
}