#include <bits/stdc++.h>
int nextInt() {
  int x;
  scanf("%d", &x);
  return x;
}
double nextDouble() {
  double x;
  scanf("%lf", &x);
  return x;
}
long long nextLong() {
  long long x;
  scanf("%I64d", &x);
  return x;
}
char nextChar() {
  char x;
  scanf("%c", &x);
  return x;
}
void newLine() { printf("\n"); }
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
long long pow(long long a, long long b, long long MOD) {
  long long x = 1, y = a;
  while (b > 0) {
    if (b % 2 == 1) {
      x = (x * y);
      if (x > MOD) x %= MOD;
    }
    y = (y * y);
    if (y > MOD) y %= MOD;
    b /= 2;
  }
  return x;
}
int countBitSet(long long n) {
  int ans = 0;
  while (n != 0) {
    n -= (n & -n);
    ++ans;
  }
  return ans;
}
int getLastSetBit(int n) {
  int ans;
  for (int i = 0; i < 25; i++) {
    if (n & (1 << i)) ans = i;
  }
  return ans;
}
long long mod = 1e9 + 7;
const int N = 100100;
const int M = 1000002;
const double eps = 1e-9;
using namespace std;
int main() {
  int n = nextInt(), h = nextInt();
  double area = (0.5 * h) / (1.0 * n);
  double t = area;
  for (int i = 0; i < n - 1; i++) {
    cout << fixed << setprecision(10) << sqrt((t * 1.0 * h) / 0.5) << " ";
    t = t + area;
  }
  return 0;
}
