#include <bits/stdc++.h>

using namespace std;

typedef long double f64;

const int N = 10005;
int n, m;
f64 val[N], ans[55], c[55][55], v[55];

int main() {
    cin >> n >> m;
    val[0] = 1;
    for (int i = 1; i <= m - n; i++) {
        val[i] = val[i - 1] * (m - n - i + 1) / (m - i + 1);
    }
    for (int i = 0; i <= n; i++) {
        c[i][0] = c[i][i] = 1;
        for (int j = 1; j < i; j++) {
            c[i][j] = c[i - 1][j - 1] + c[i - 1][j];
        }
    }

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j * i + n - i <= m; j++) {
            v[i] += val[i * (j - 1)];
        }
    }

    for (int k = 1; k <= n; k++) {
        for (int j = k; j <= n; j++) {
            int fg = (j - k) % 2 ? -1 : 1;
            ans[k] += fg * c[n][j] * v[j] * c[j - 1][k - 1];
        }
    }

    reverse(ans + 1, ans + n + 1);
    for (int i = 2; i <= n; i++) {
        ans[i] += ans[i - 1];
    }
    for (int i = 1; i <= n; i++) {
        cout << fixed << setprecision(10) << ans[i] << endl;
    }
}