#include <bits/stdc++.h>
using namespace std;
long long A[10][10] = {};
void rec(long long x, long long y, long long n) {
  if ((n % 2) == 0) {
    A[x][y] = n + 1;
  }
  if (n == 0)
    return;
  else {
    long long arrx[] = {-2, 2};
    long long arry[] = {-1, 1};
    for (auto i : arrx) {
      for (auto j : arry) {
        long long newx = x + i, newy = y + j;
        if (newx >= 0 && newx < 10 && newy >= 0 && newy < 10) {
          {
            cerr << "> "
                 << "newx"
                 << ": " << newx << " , "
                 << "newy"
                 << ": " << newy << endl;
          };
          if (A[newx][newy] < n) rec(newx, newy, n - 1);
        }
      }
    }
    for (auto j : arrx) {
      for (auto i : arry) {
        long long newx = x + i, newy = y + j;
        if (newx >= 0 && newx < 10 && newy >= 0 && newy < 10) {
          {
            cerr << "> "
                 << "newx"
                 << ": " << newx << " , "
                 << "newy"
                 << ": " << newy << endl;
          };
          if (A[newx][newy] < n) rec(newx, newy, n - 1);
        }
      }
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  while (t--) {
    double n, h;
    cin >> n >> h;
    double f = h / sqrt(n);
    cout << setprecision(9);
    for (long long i = 0; i < n - 1; i++) {
      cout << f * sqrt(i + 1) << ' ';
    }
  }
}
