#include <bits/stdc++.h>
using namespace std;

const int MN = 17, MT = 105, MS = 1<<MN;
const double EPS = 1e-13;

int N, T, rt[MN], ct[MN]; double ps[MN];
double ft[MT][1<<MN], solves[MT][MN];

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

    cin >> N >> T;
    for (int i = 0; i < N; i++)
        cin >> rt[i] >> ct[i] >> ps[i];
    ft[0][0] = 1;
    for (int t = 0; t <= T; t++) {
        for (int b = 0; b < 1<<N; b++) {
            double den = 0;
            for (int i = 0; i < N; i++)
                if (~b&1<<i)
                    den += solves[t][i];
            for (int i = 0; i < N; i++)
                if (~b&1<<i) {
                    double x = ft[t][b] * (den < EPS ? 
                        1. / (N-__builtin_popcount(b)) : solves[t][i] / den);
                    if (t+rt[i] <= T) {
                        ft[t+rt[i]][b|1<<i] += x * (1-ps[i]);
                    }
                    if (t+rt[i]+ct[i] <= T) {
                        ft[t+rt[i]+ct[i]][b|1<<i] += x * ps[i];
                        solves[t+rt[i]+ct[i]][i] += x * ps[i];
                    }
                }
        }
        for (int i = 0; i < N; i++)
            solves[t+1][i] += solves[t][i];
    }
    for (int i = 0; i < N; i++)
        printf("%.8f\n", solves[T][i]);

    return 0;
}