#include <bits/stdc++.h>

using namespace std;


const int MaxTime = 302, MaxMask = (1<<17) + 2;

struct problem
{
    int read, code;
    double prob;
} a[20];


int n, lim_time;

double solved[MaxTime][20];
double dp[MaxTime][MaxMask];

inline void go_to(double &x, double y)
{
    x += y;
}


int main()
{
  //  freopen("input", "r", stdin);
    cin.sync_with_stdio(false); cin.tie(0);


    cout << setprecision(6) << fixed;

    cin >> n >> lim_time;

    int unread, t, p;

    for(int i=0; i<n; ++i)
        cin >> a[i].read >> a[i].code >> a[i].prob;

    dp[0][(1<<n) - 1] = 1; // all unread

    for(t=0; t<=lim_time; ++t)
    {
        if(t)
        {
            for(p=0; p<n; ++p)
                solved[t][p] += solved[t-1][p];
        }

        for(unread = 0; unread < (1<<n); ++unread)
        {
            double total_solved = 0;
            for(p = 0; p < n; ++p)
                if(unread & (1<<p))
                    total_solved += solved[t][p];

            for(p = 0; p < n; ++p)
                if(unread & (1<<p))
                {
                    double choose_p;

                    if(total_solved > 0)
                        choose_p = solved[t][p] / total_solved;
                    else choose_p = (double) 1 / __builtin_popcount(unread);

                    go_to(dp[t+a[p].read][unread ^ (1<<p)],           dp[t][unread] * choose_p * (1 - a[p].prob));

                    go_to(dp[t+a[p].read+a[p].code][unread ^ (1<<p)], dp[t][unread] * choose_p * a[p].prob);

                    go_to(solved[t+a[p].read+a[p].code][p],           dp[t][unread] * choose_p * a[p].prob);
                }
        }
    }

    for(p=0; p<n; ++p)
        cout << solved[lim_time][p] << '\n';


    return 0;
}