#include <bits/stdc++.h>

template <class T>
inline void read(T &res)
{
	char ch; bool flag = false; res = 0;
	while (ch = getchar(), !isdigit(ch) && ch != '-');
	ch == '-' ? flag = true : res = ch ^ 48;
	while (ch = getchar(), isdigit(ch))
		res = res * 10 + ch - 48;
	flag ? res = -res : 0;
}

template <class T>
inline void put(T x)
{
	if (x > 9)
		put(x / 10);
	putchar(x % 10 + 48);
}

template <class T>
inline void _put(T x)
{
	if (x < 0)
		x = -x, putchar('-');
	put(x);
}

template <class T>
inline void CkMin(T &x, T y) {x > y ? x = y : 0;}
template <class T>
inline void CkMax(T &x, T y) {x < y ? x = y : 0;}
template <class T>
inline T Min(T x, T y) {return x < y ? x : y;}
template <class T>
inline T Max(T x, T y) {return x > y ? x : y;}
template <class T>
inline T Abs(T x) {return x < 0 ? -x : x;}
template <class T>
inline T Sqr(T x) {return x * x;}
// 若传入 int x 同时结果可能爆 int 应这样写 Sqr((ll)x)

using std::map;
using std::set;
using std::pair;
using std::bitset;
using std::string;
using std::vector;
using std::complex;
using std::multiset;
using std::priority_queue;

typedef long long ll;
typedef long double ld;
typedef complex<ld> com;
typedef pair<int, int> pir;
const ld pi = acos(-1.0);
const int Maxn = 1e9;
const int Minn = -1e9;
const int mod = 998244353;

const int N = 8; 
const int S = (1 << 6) + 5;
const int M = 1e4 + 5;
int T_data, n, m, _c;
int sc[N][3], succ[N][S], fail[N][S];
int u[N][4], v[N][4];
ld f[M][N][S];

inline ld calc_f(int k, int i, int s)
{
	ld res = i > 1 && k >= succ[i - 1][s] ? f[k - succ[i - 1][s]][1][0] : 0; 
	ld rig = 0, lef = 0, t[3];
	t[0] = t[1] = t[2] = 0;
	
	t[0] = k >= fail[i - 1][s] ? f[k - fail[i - 1][s]][1][0] : 0;
	if (i < n)
	{
		t[1] = f[k][i + 1][s];
		t[2] = f[k][i + 1][1 << i - 1 | s];
	}
	else
	{
		t[1] = k >= succ[n][s] ? f[k - succ[n][s]][1][0] : 0;
		t[2] = k >= succ[n][1 << i - 1 | s] ? f[k - succ[n][1 << i - 1 | s]][1][0] : 0;
	}
	for (int j = 0; j <= 2; ++j)
		lef += v[i][j] * t[j];
	CkMax(res, lef / v[i][3]);
	for (int j = 0; j <= 2; ++j)
		rig += u[i][j] * t[j];
	CkMax(res, rig / u[i][3]);
	return res;	
}

inline void calc_totf(int k, ld f00)
{
	for (int i = n; i >= 1; --i)
		for (int s = 0; s < (1 << i - 1); ++s)
			f[k][i][s] = 0;
	f[k][1][0] = f00;
	for (int i = n; i >= 1; --i)
		for (int s = (1 << i - 1) - 1; s >= 0; --s)
			f[k][i][s] = calc_f(k, i, s);
	
}

int main()
{	
	read(n); read(m); read(_c); 
	for (int i = 1; i <= n; ++i)
	{
		read(sc[i][1]);
		read(sc[i][2]);
		for (int t = 0; t <= 2; ++t)
			read(u[i][t]);
		u[i][3] = u[i][0] + u[i][1] + u[i][2];
		for (int t = 0; t <= 2; ++t)
			read(v[i][t]);
		v[i][3] = v[i][0] + v[i][1] + v[i][2];	
	}
	for (int i = n; i >= 1; --i)
		for (int s = 0; s < (1 << i); ++s)
		{
			for (int j = 0; j < i; ++j)
				succ[i][s] += sc[j + 1][(s >> j & 1) + 1];
			fail[i][s] = _c * succ[i][s] / 100.0;
		}
	
	f[0][1][0] = 1.0;
	for (int k = 1; k <= m; ++k)
	{
		ld l = 0, r = 1.0;
		while (r - l > 1e-18)
		{
			ld mid = (l + r) / 2.0;
			calc_totf(k, mid);
			f[k][1][0] > mid ? l = mid : r = mid;
		}
		printf("%.18Lf ", f[k][1][0] = (l + r) / 2.0);
	}
	putchar('\n');
	return 0;
}