CodeForces - 908C New Year and Curling

Carol is currently curling.

She has n disks each with radius r on the 2D plane.

Initially she has all these disks above the line y = 10¹⁰⁰.

She then will slide the disks towards the line y = 0 one by one in order from 1 to n.

When she slides the i-th disk, she will place its center at the point (x_i, 10¹⁰⁰). She will then push it so the disk’s y coordinate continuously decreases, and x coordinate stays constant. The disk stops once it touches the line y = 0 or it touches any previous disk. Note that once a disk stops moving, it will not move again, even if hit by another disk.

Compute the y-coordinates of centers of all the disks after all disks have been pushed.

Input

The first line will contain two integers n and r (1 ≤ n, r ≤ 1 000), the number of disks, and the radius of the disks, respectively.

The next line will contain n integers x₁, x₂, ..., x_n (1 ≤ x_i ≤ 1 000) — the x-coordinates of the disks.

Output

Print a single line with n numbers. The i-th number denotes the y-coordinate of the center of the i-th disk. The output will be accepted if it has absolute or relative error at most 10^- 6.

Namely, let's assume that your answer for a particular value of a coordinate is a and the answer of the jury is b. The checker program will consider your answer correct if  for all coordinates.

Example

Input

6 2
5 5 6 8 3 12

Output

2 6.0 9.87298334621 13.3370849613 12.5187346573 13.3370849613

Note

The final positions of the disks will look as follows:

In particular, note the position of the last disk.

题意：在y=10^100的线上往y=0的线上扔冰壶（不计阻力）。按扔出的顺序给出每个冰壶扔出时的x坐标，当冰壶碰到y=0的线或者其他冰壶时就会停下，所有冰壶一旦停下就不会再运动。求一下每个冰壶最后停的位置的y坐标。

解题思路：

先说一下老铁们的思路：在每个冰壶扔出之前判断一下之前所有冰壶能不能与这个冰壶发生碰撞（距离x<=2r），把能发生碰撞的冰壶按圆心高度从大到小排序，那么当前的冰壶的高度就更新为与这个圆心高度最大的冰壶的计算结果。

仔细想一下这样是不对的。这样判断的话只是对单一的一个冰壶来判断，应该考虑整体来判断。想一下存在一种情况：当当前的冰壶还未接触到圆心高度最大的冰壶可能就已经接触到圆心高度不是最大的冰壶。

还是画个丑丑的图吧= =

嗯，就这样= =

那么应该怎么判断呢：

在每一个冰壶扔出之前，初始他的高度为r。和每一个之前的冰壶计算一下结果，如果发生接触则更新高度。最后直接输出高度就行了。

AC代码：

#include<stdio.h>
#include<math.h>
#include<algorithm>
using namespace std;

double x[1010],y[1010],r;

int main()
{
	int n;
	scanf("%d%lf",&n,&r);
	for(int i=1;i<=n;i++)
	{
		scanf("%lf",&x[i]);
		
		y[i]=r;
		for(int j=1;j<=i-1;j++)
		{
			if(fabs(x[i]-x[j])<=2*r)
			{
				y[i]=max(y[i],y[j]+sqrt(4*r*r-(x[i]-x[j])*(x[i]-x[j])));
			}
		}
		printf("%.7lf ",y[i]);
	}
	return 0;
}