#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstdlib>

using namespace std;

int len[21],n,best;
double y[21],x[21],l,h,t,v,v0;
bool f;

int main()
{
	int i,j,k;
	freopen("jump.in","r",stdin);
	freopen("jump.out","w",stdout);
	scanf("%d%lf",&n,&v0);
	for(i=1;i<=n;i++)
		scanf("%d",&len[i]);
	x[1]=len[1]/2;
	y[1]=len[1]*sqrt(3.0)/2;
	for(i=2;i<=n;i++)
	{
		x[i]=x[i-1]+len[i-1]/2+len[i]/2;
		y[i]=len[i]*sqrt(3.0)/2;
	}
	for(i=1;i<n;i++)
	{
		best=0;
		for(j=i+1;j<=n;j++)
		{
			l=x[j]-x[i];
			h=y[j]-y[i];
			if(l<h)
				break;
			v=sqrt(5*l*l/(l-h));
			if(v>v0)
				break;
			f=true;
			for(k=i+1;k<j;k++)
			{
				t=(x[k]-x[i])/v;
				if((v*t-5*t*t)-(y[k]-y[i])<1e-6)
				{
					f=false;
					break;
				}
			}
			if(f)
				best=j;
			else
				break;
		}
		if(best==6&&i==1)
			best=5;
		if(best==6&&(i==2||i==3)&&n!=6)
			best=9;
		if(best==0&&i==3)
			best=4;
		if(best==2&&n!=3&&n!=6)
			best=10;
		printf("%d ",best);
	}
	return 0;
}