#include <cstdio>
using namespace std;
typedef double myfloat;
constexpr int MAXN = 17;
constexpr int MAXT = 100;

struct Problem
{
	short read, code;
	myfloat prob;
};

Problem v[MAXN];
myfloat ft[2 * MAXT][1 << MAXN];
myfloat sol[2 * MAXT][MAXN];

int main()
{
	int N, T;
	scanf("%d %d", &N, &T);
	for (int i = 0; i < N; i++)
		scanf("%hd %hd %lf", &v[i].read, &v[i].code, &v[i].prob);

	ft[0][0] = 1.0;
	for (int t = 0; t <= T; t++)
	{
		for (int m = 0; m < (1 << N); m++)
		{
			const myfloat f = ft[t][m];
			if (f == 0.0)
				continue;
			myfloat sum = 0;
			short urpcnt = 0;
			for (int i = 0; i < N; i++)
				if (~m & (1 << i))
				{
					sum += sol[t][i];
					urpcnt++;
				}
			for (int i = 0; i < N; i++)
				if (~m & (1 << i))
				{
					const auto &[r, c, p] = v[i];
					const myfloat g = f * (sum == 0 ? 1.0 / urpcnt : sol[t][i] / sum);
					const myfloat gr = g * (1.0 - p);
					const myfloat gc = g * p;
					if (t + r <= T)
						ft[t + r][m | (1 << i)] += gr;
					if (t + r + c <= T)
					{
						ft[t + r + c][m | (1 << i)] += gc;
						sol[t + r + c][i] += gc;
					}
				}
		}
		for (int i = 0; i < N; i++)
			sol[t + 1][i] += sol[t][i];
	}

	for (int i = 0; i < N; i++)
		printf("%.10lf\n", sol[T][i]);
	return 0;
}