#include <iostream>
#include <map>
#include <iomanip>
#include <algorithm>
#include <vector>
using namespace std ;
const int MAXN = 101 ;
const int MAXM = 10001 ;
double *c[2][MAXN][MAXM] ;
int main() {
   int n, m ;
   cout << setprecision(15) ;
   int rd = 0 ;
   int wr = 1 ;
   cin >> n >> m ;
   m -= n ;
   for (int seq=0; seq<=n; seq++)
      for (int mm=0; mm<=m; mm++) {
         c[rd][seq][mm] = (double*)calloc(MAXN+1, sizeof(double)) ;
         c[wr][seq][mm] = (double*)calloc(MAXN+1, sizeof(double)) ;
         c[rd][seq][mm][0] = 1 ;
      }
   for (int nn=1; nn<=n; nn++) {
      for (int seq=0; seq+nn<=n; seq++) {
         if ((nn != n) == (seq == 0))
            continue ;
         for (int mm=0; mm<=m; mm++) {
            int wseq = seq ;
            for (int i=0; i<nn; i++)
               c[wr][seq][mm][i] = 0 ;
            for (int f=0; f*nn<=mm; f++) {
               auto t = c[rd][wseq+1][mm-f*nn] ;
               double cnt = t[0] / (wseq+1.) ;
               c[wr][seq][mm][0] += cnt ;
               c[wr][seq][mm][1] += f * cnt ;
               if (wseq == 0) {
                  for (int i=1; i<nn; i++)
                     c[wr][seq][mm][i+1] += (t[i] + f * t[0]) ;
               } else {
                  for (int i=1; i<nn; i++)
                     c[wr][seq][mm][i+1] += (t[i] + f * t[0]) / (wseq + 1.0) ;
               }
               wseq = 0 ;
            }
         }
      }
      swap(rd, wr) ;
   }
   double s = 0 ;
   auto t = c[rd][0][m] ;
   for (int i=1; i<=n; i++) {
      auto v = 1 + t[i] / t[0] ;
      s += v ;
      cout << s << endl ;
   }
}