Problem: Igor the analyst has adopted n little bunnies. As we all know, bunnies love carrots. Thus, Igor has bought a carrot to be shared between his bunnies. Igor wants to treat all the bunnies equally, and thus he wants to cut the carrot into n pieces of equal area. 

Formally, the carrot can be viewed as an isosceles triangle with base length equal to 1 and height equal to h. Igor wants to make n - 1 cuts parallel to the base to cut the carrot into n pieces. He wants to make sure that all n pieces have the same area. Can you help Igor determine where to cut the carrot so that each piece have equal area?

<image> Illustration to the first example.

Input

The first and only line of input contains two space-separated integers, n and h (2 ≤ n ≤ 1000, 1 ≤ h ≤ 105).

Output

The output should contain n - 1 real numbers x1, x2, ..., xn - 1. The number xi denotes that the i-th cut must be made xi units away from the apex of the carrot. In addition, 0 < x1 < x2 < ... < xn - 1 < h must hold. 

Your output will be considered correct if absolute or relative error of every number in your output doesn't exceed 10 - 6.

Formally, let your answer be a, and the jury's answer be b. Your answer is considered correct if <image>.

Examples

Input

3 2


Output

1.154700538379 1.632993161855


Input

2 100000


Output

70710.678118654752

Note

Definition of isosceles triangle: <https://en.wikipedia.org/wiki/Isosceles_triangle>.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int dx[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int dy[] = {-1, 0, 1, -1, 1, -1, 0, 1};
int xChange[] = {0, 1, 0, -1};
int yChange[] = {1, 0, -1, 0};
double ebs = 0.00000001;
long double height, n, area_of_part, cur_height = 0.0;
bool check(long double mid) {
  long double new_base = mid / height;
  long double new_area =
      (0.5 * new_base * mid) - (0.5 * (cur_height / height) * cur_height);
  return new_area < area_of_part;
}
int main() {
  ios::sync_with_stdio(false), cin.tie(NULL);
  cin >> n >> height;
  area_of_part = 0.5 * height / n;
  int x = n - 1;
  while (x--) {
    long double s, e, mid;
    s = 0, e = height;
    while (e - s > ebs) {
      mid = (s + e) / 2.0;
      if (check(mid))
        s = mid;
      else
        e = mid;
    }
    cout << fixed << setprecision(10) << mid << " ";
    cur_height = mid;
  }
  return 0;
}