#include "bits/stdc++.h"
#define rep(i, a, n) for (auto i = a; i <= (n); ++i)
#define revrep(i, a, n) for (auto i = n; i >= (a); --i)
#define all(a) a.begin(), a.end()
#define sz(a) (int)(a).size()
template<class T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T &a, T b) { if (b < a) { a = b; return 1; } return 0; }
using namespace std;

template<class A, class B> string to_string(pair<A, B> p);
string to_string(const string &s) { return '"' + s + '"'; }
string to_string(const char *s) { return to_string((string) s); }
string to_string(char c) { return "'" + string(1, c) + "'"; }
string to_string(bool x) { return x ? "true" : "false"; }
template<class A> string to_string(A v) {
	bool first = 1;
	string res = "{";
	for (const auto &x: v) {
		if (!first) res += ", ";
		first = 0;
		res += to_string(x);
	}
	res += "}";
	return res;
}
template<class A, class B> string to_string(pair<A, B> p) { return "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; }

void debug_out() { cerr << endl; }
template<class H, class... T> void debug_out(H h, T... t) {
	cerr << " " << to_string(h);
	debug_out(t...);
}
#ifndef ONLINE_JUDGE
	#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
	#define debug(...) if(0) puts("No effect.")
#endif

using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;

template<class T>
struct Line {
	T k, b;
	int ind;

	T capLL(const Line &rhs) const {
		return (b - rhs.b) / (rhs.k - k);
	}
};


int main() {
	ios::sync_with_stdio(0); cin.tie(0);

	using T = long double;
	using L = Line<T>;

	int n; T X; cin >> n >> X;
	vector<T> xs(n), ys(n), ws(n), hs(n);
	rep(i, 0, n - 1) {
		cin >> xs[i] >> ys[i] >> ws[i] >> hs[i];
	}
	auto getline = [&](T x, T y, int ind) {
		return L{-2 * x, x * x + y * y, ind};
	};
	vector<L> ls;
	rep(i, 0, n - 1) {
		ls.push_back(getline(xs[i], ys[i], i));
		ls.push_back(getline(xs[i] + ws[i], ys[i], i));
	}
	sort(all(ls), [&](L a, L b) {
		if (a.k != b.k) return a.k > b.k;
		else if(a.b != b.b) return a.b < b.b;
		else return a.ind < b.ind;
	});
	vector<L> q;
	rep(i, 0, sz(ls) - 1) {
		if (i && ls[i].k == ls[i - 1].k) continue;
		while (sz(q) > 1 && ls[i].capLL(q.end()[-1]) < q.end()[-1].capLL(q.end()[-2])) q.pop_back();
		q.push_back(ls[i]);
	}
	while (sz(q) > 1 && q.end()[-1].capLL(q.end()[-2]) > X) q.pop_back();
	reverse(all(q));
	while (sz(q) > 1 && q.end()[-1].capLL(q.end()[-2]) < 0) q.pop_back();
	reverse(all(q));

	vector<T> nums{0};
	rep(i, 0, sz(q) - 2) {
		auto x = q[i].capLL(q[i + 1]);
		nums.push_back(x);
	}
	nums.push_back(X);
	
	vector<tuple<T, T, int, int>> ops;
	rep(i, 0, n - 1) {
		T y2 = ys[i] * ys[i];
		T l = xs[i];
		T r = xs[i] + ws[i];
		ops.emplace_back(l, y2, i, -1);
		ops.emplace_back(r, y2, i, 1);
	}
	sort(all(ops));
	set<pair<T, int >> S;
	vector<tuple<T, T, T, int>> segs;
	T last = -1;
	for (auto [x, y2, ind, op]: ops) {
		if (sz(S)) {
			auto [y2, ind] = *S.begin();
			segs.emplace_back(last, x, y2, ind);
		}
		if (op == -1) S.emplace(y2, ind);
		else S.erase({y2, ind});
		last = x;
	}

	vector<T> ans(n);
	rep(i, 0, sz(q) - 1) {
		auto ind = q[i].ind;
		ans[ind] += nums[i + 1] - nums[i];
	}
	for (auto [l, r, y, seg_ind]: segs) {
		int pos = upper_bound(all(nums), l) - nums.begin() - 1;	
		while (pos < sz(q) && nums[pos] < r) {
			auto L = max(l, nums[pos]);
			auto R = min(r, nums[pos + 1]);
			auto [k, b, para_ind] = q[pos];
			T A = 1;
			T B = k;
			T C = b - y;
			auto delta = B * B - 4 * A * C;
			if (delta <= 0) {
				ans[para_ind] -= R - L;
				ans[seg_ind] += R - L;
			} else {
				auto x1 = (-B - sqrt(delta)) / (A * 2); 
				auto x2 = (-B + sqrt(delta)) / (A * 2); 
				chmax(x1, L);
				chmin(x2, R);
				T len = x1 < x2 ? x2 - x1 : 0;
				ans[para_ind] -= R - L - len;
				ans[seg_ind] += R - L - len;
			}
			pos++;
		}
	}
	for (auto x: ans) {
		printf("%.10f\n", (double) (x / X * 100));
	}
	return 0;
}