#include <bits/stdc++.h>
using namespace std;
int n, h;
double ans, rem, s;
vector<double> sol;
double l;
int main() {
  scanf("%d%d", &n, &h);
  ans = 1. * h / (2 * n);
  l = 1;
  rem = (double)h;
  double all = 1. * h / 2;
  int m = n;
  double midd;
  for (int i = 1; i <= n - 1; i++) {
    midd = h * sqrt(1. * i / n);
    sol.push_back(midd);
    rem -= rem / sqrt(m);
    m--;
  }
  int sz = sol.size();
  for (int i = sz - 1; i >= 0; i--) printf("%.7f ", sol[n - 1 - 1 - i]);
}
