#include <cstdio>
#include <cmath>
const int MAXN = 11, g2 = 10 / 2;
const double q32 = sqrt(3) * 0.5;
int n, v0, l[MAXN], best;
bool flag;
double x[MAXN], y[MAXN], s, h, v, t;
int main() {
	freopen("jump.in", "r", stdin);
	freopen("jump.out", "w", stdout);
	scanf("%d %d", &n, &v0);
	for(int i=1; i<=n; i++)
		scanf("%d", l+i);
	for(int i=1; i<=n; i++) {
		x[i] = x[i-1] + l[i-1]*0.5 + l[i]*0.5;
		y[i] = l[i] * q32;
	}
	for(int i=1; i<n; i++) {
		for(int j=i+1; j<=n; j++) {
			s = x[j] - x[i];
			h = y[j] - y[i];
			if(s < h)
				break;
			v = sqrt(g2*s*s/(s-h));
			if(v > v0)
				break;
			flag = true;
			for(int k=i+1; k<j; k++) {
				t = (x[k] - x[i])/ v;
				if(v*t - g2*t*t < y[k] - y[i]) {
					flag = false;
					break;
				}
			}
			if(flag)
				best = j;
			else
				break;
		}
		printf("%d ", best);
	}
	return 0;
}