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 PYTHON):

Solution:
import math

def sort(arr):
    if len(arr) <= 1:
        return arr
    else:   
        pivot = arr[0]
        small, big, pivotlist = [], [], []
        for each in arr:
            if pivot < each:
                big.append(each)
            elif pivot > each:
                small.append(each)
            else:
                pivotlist.append(each)
        return sort(small) + pivotlist + sort(big)

# pos, g1, g2 = map(int,raw_input().split())
# num = input()
# arr = map(int,raw_input().split())
# arr = sort(arr)
# ans = 0
# for i in arr:
#     if i > g1 and i < g2:
#         ans += 1
# print ans

piece, h = map(int,raw_input().split())
## suppose base length = 2
each_area = h / float(piece)
arr = []
# first = True
for i in range(1, piece):
    arr.append(math.sqrt(i * each_area * h))
    # if first:
    #     first = False
    #     inst_h = math.sqrt(each_area * h)
    #     prev_h = inst_h
    # else:
    #     inst_h = 
    #     prev_area += inst_h
    # arr.append(prev)
for j in arr:
    print j,