#include<bits/stdc++.h>

using namespace std;
typedef double db;
typedef pair<int, int> pi;

#define FOR(i, a, b) for (int i = (a); i < (b); i++) 
#define F0R(i, a) FOR(i, 0, a)
#define rsz resize
#define mp make_pair

int n, m;
vector<db> dp[51][10001];
db fact[10001], ch[10001][51];

// db choose(int n, int k) {
    // if (pre.find(mp(n,k)) != pre.end()) return pre[mp(n,k)];
    // if (k > n) return 0;
    // db ans = 1;
    // F0R(i, k) ans *= db(n-i) / db(i+1);
    // pre[mp(n,k)] = ans;
    // return ans;
// }

int main() {
    cin.tie(0) -> sync_with_stdio(0);
    fact[0] = 1;
    FOR(i, 1, 10001) fact[i] = fact[i-1]*i;
    F0R(k, 51) FOR(n, k, 10001) ch[n][k] = fact[n] / (fact[k] * fact[n-k]);
    cin >> n >> m;
    FOR(i, 1, n+1) {
        FOR(j, i, m+1) {
            dp[i][j].assign(i,1);
            FOR(k, max(0, 2*i-j), i+1) {
                db prob = ch[i][k] * ch[j-i][i-k] / ch[j][i];
                FOR(a, k, i) dp[i][j][a] += dp[i-k][j-i][a-k] * prob;
            }
        }
    }
    cout << fixed << setprecision(8);
    FOR(i, 1, n) dp[n][m][i] += dp[n][m][i-1];
    // cout << "done" << endl;
    F0R(i, n) cout << dp[n][m][i] << '\n';
}