#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
long long powmod(long long a, long long b) {
  long long res = 1;
  a %= mod;
  assert(b >= 0);
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
double h;
int n;
double x[1003];
int main() {
  cin >> n >> h;
  double S = 0.5 * 1 * h;
  S = S / n;
  double x1 = sqrt(S / 0.5 * h);
  x[1] = x1;
  double tmp = S;
  for (int i = 2; i <= n - 1; i++) {
    tmp = tmp + S;
    x[i] = sqrt((tmp) / 0.5 * h);
  }
  for (int i = 1; i <= n - 1; i++)
    cout << fixed << setprecision(12) << x[i] << " ";
  return 0;
}
