#include <bits/stdc++.h>
const double PI = acos(-1.0);
using namespace std;
const int MAXN = 1024;
double ans[MAXN];
double rets[MAXN];
int n;
double h;
int main() {
  while (scanf("%d%lf", &n, &h) == 2) {
    for (int i = 1; i <= n; i++) {
      double &ret = ans[i];
      ret = h * sqrt(i) / sqrt(n);
    }
    for (int i = 1; i <= n; i++) rets[i] = ans[i] - ans[i - 1];
    bool firstBlank = true;
    for (int i = 1; i < n; i++) {
      if (firstBlank)
        firstBlank = false;
      else
        printf(" ");
      printf("%.13f", ans[i]);
    }
    printf("\n");
  }
  return 0;
}
