C. 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

Copy

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:

#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#define ls(x) (x<<1)
#define rs(x) (x<<1|1)
typedef long long ll;
using namespace std;
const int maxn=1e3+10;
const double eps=1e-6;
struct Circle{
	double x,y;
	Circle(){}
	Circle(double _x,double _y){
		x=_x,y=_y;
	}
}cir[maxn]; 

int n;double r;

int inter(double x,int j){
	if(fabs(x-cir[j].x)<=2.0*r)
		return 1;
	return 0;
}
/*
写错了判断条件，因为我们找的是y的最大值，如果我们用cir[j].y>cir[i].y
这样的条件的话，我们已经失去了可能使得y升高的可能，我们找的是最大的y值，
而不一定是最高矩形 
*/

int main(){
	scanf("%d %lf",&n,&r);
	for(int i=1;i<=n;i++){
		double x;
		scanf("%lf",&x);
		cir[i]=(Circle){x,r};
		for(int j=1;j<i;j++){
			if(inter(x,j)){
				cir[i].y=max(cir[i].y,sqrt(4.0*r*r-(cir[j].x-cir[i].x)*(cir[j].x-cir[i].x))+cir[j].y);
			}
		}
	}
	for(int i=1;i<=n;i++){
		if(i==1)
			printf("%.7f",cir[i].y);
		else
			printf(" %.7f",cir[i].y);
	}
	printf("\n");
	return 0;
}