#include <bits/stdc++.h>

using namespace std; const int maxn = 51, maxm = 10001;

const int H = 1e9;

inline void add(vector<int> &a, const vector<int> &b)
{
    while (a.size() < b.size()) a.push_back(0);
    int x = 0;
    int i;
    for (i = 0; i < b.size(); i++)
    {
        x += a[i] + b[i];
        if (x >= H) a[i] = x - H, x = 1;
        else a[i] = x, x = 0;
        assert(a[i] < H);
    }
    while (x && i < a.size())
    {
        x += a[i];
        if (x >= H) a[i] = x - H, x = 1;
        else a[i] = x, x = 0;
        assert(a[i] < H);
        i++;
    }
    if (x) a.push_back(1); 
}

inline __float128 trans(const vector<int> &a)
{
    __float128 res = 0;
    for (int i = int(a.size()) - 1; i >= 0; i--) res = res * H + a[i];
    return res;
}

vector<int> C[maxm][maxn]; __float128 C_[maxn][maxn];

int n, m;

__float128 tot, f[maxn];

__float128 Ans;

int main()
{
    for (int i = 0; i < maxm; i++)
    {
        C[i][0] = { 1 };
        for (int j = 1; j <= i && j < maxn; j++) C[i][j] = C[i - 1][j - 1], add(C[i][j], C[i - 1][j]);
    }
    for (int i = 0; i < maxn; i++)
    {
        C_[i][0] = 1;
        for (int j = 1; j <= i && j < maxn; j++) C_[i][j] = C_[i - 1][j - 1] + C_[i - 1][j];
    }
    // cout << C_[50][25] << endl;
    // cout << trans(C[50][25]) << endl;
    // for (int x : C[50][25]) printf("%9d", x); cerr << endl;
    // return 0;
    cin >> n >> m;
    tot = trans(C[m][n]);
    // cout << tot << endl;
    for (int i = 1; i <= n; i++)
    {
        vector<int> now;
        for (int j = 0; m - i * j >= n; j++) add(now, C[m - i * j][n]);
        f[i] = trans(now) / tot;
        // cerr << f[i] << endl;
    }
    cout << setprecision(12);
    for (int k = n; k; k--)
    {
        for (int i = k; i <= n; i++)
        {
            Ans += f[i] * C_[i - 1][k - 1] * C_[n][i] * (i - k & 1 ? -1 : 1);
        }
        cout << (double)Ans << endl;
    }
    return 0;
}