#include <bits/stdc++.h>

using namespace std;

const int maxn = 55;
const int maxm = 10005;

int n, m;
long double binom[maxm][maxn];
long double f[maxn][maxm][maxn];

int main(){
	scanf("%d%d", &n, &m);
	for (int i = 0; i < maxm; ++i) for (int j = 0; j < maxn && j <= i; ++j) {
		binom[i][j] = 1;
		for (int k = 0; k < j; ++k) binom[i][j] *= (long double)(i - k) / (long double)(j - k);
	}
	
	for (int i = 1; i <= n; ++i) for (int j = i; j <= m; ++j) {
		for (int k = 0; k <= i; ++k) {
			long double res = binom[j - i][k] * binom[i][k];
			for (int x = 1; x <= k; ++x) f[i][j][x + i - k] += res * f[k][j - i][x];
		}
		for (int x = 1; x <= n; ++x) f[i][j][x] /= binom[j][i];
		for (int x = 1; x <= n; ++x) f[i][j][x] += x;
	}
	
	for (int k = 1; k <= n; ++k) printf("%.10Lf ", f[n][m][k]); puts("");
	return 0;
}