#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 7;
const long long INFL = 1e18 + 123;
const double PI = atan2(0, -1);
int main() {
  cerr << fixed << setprecision(15);
  cout << fixed << setprecision(15);
  int n, h;
  scanf("%d%d", &n, &h);
  double s = (h * 1) / 2.0 / n;
  double cur = 1;
  vector<double> ans;
  for (int i = 0; i < n - 1; ++i) {
    double l = cur, r = 0;
    for (int j = 0; j < 100; ++j) {
      double mid = (l + r) / 2;
      if ((cur - mid) * h * (cur + mid) / 2 > s) {
        r = mid;
      } else {
        l = mid;
      }
    }
    ans.push_back(l * h);
    cur = l;
  }
  sort(begin(ans), end(ans));
  for (auto num : ans) {
    cout << num << " ";
  }
  cout << "\n";
  return 0;
}
