#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

const int MAX_N = 17;
const int MAX_T = 100 + 1;
const double EPS = 1e-15;

double dp[MAX_T][1 << MAX_N];
double score[MAX_T][MAX_N];
double scsum[MAX_T][1 << MAX_N];
bool ok[MAX_T][1 << MAX_N];
int popcnt[1 << MAX_N];

void solve() {
    int n, T;
    cin >> n >> T;
    vector<int> r(n), c(n);
    vector<double> pr(n);
    for (int i=0; i<n; ++i) cin >> r[i] >> c[i] >> pr[i];

    for (int i=0; i<(1<<n); ++i) popcnt[i] = __builtin_popcount(i);
    memset(dp, 0, sizeof dp);
    memset(score[0], 0, sizeof score[0]);
    memset(scsum, 0, sizeof scsum);
    dp[0][0] = 1.0;

    const int fulm = (1 << n) - 1;

    for (int t=1; t<=T; ++t) {
        memcpy(score[t], score[t-1], sizeof score[t]);
        for (int mask=0; mask<(1<<n); ++mask) {
            double sum1 = 0.0, sum2 = 0.0;
            for (int i=0; i<n; ++i) {
                if (mask & (1 << i)) {
                    int cpl = fulm ^ mask ^ (1 << i);
                    double sel_pr1 = 0.0;
                    if (t >= r[i]+c[i]) sel_pr1 = (scsum[t-r[i]-c[i]][cpl] == 0 ? 1.0 / popcnt[cpl] : score[t-r[i]-c[i]][i] / scsum[t-r[i]-c[i]][cpl]);
                    double sel_pr2 = 0.0;
                    if (t >= r[i]) sel_pr2 = (scsum[t-r[i]][cpl] == 0 ? 1.0 / popcnt[cpl] : score[t-r[i]][i] / scsum[t-r[i]][cpl]);
                    double tmp1 = (t < r[i]+c[i] ? 0.0 : dp[t-r[i]-c[i]][mask ^ (1 << i)] * pr[i] * sel_pr1);
                    double tmp2 = (t < r[i] ? 0.0 : dp[t-r[i]][mask ^ (1 << i)] * (1.0-pr[i]) * sel_pr2);
                    score[t][i] += tmp1;
                    sum1 += tmp1;
                    sum2 += tmp2;
                }
            }
            dp[t][mask] = sum1 + sum2;
            // cout << "dp: " << t << ' ' << mask << ' ' << dp[t][mask] << '\n';
        }

        // for (int i=0; i<n; ++i) cout << t << ' ' << i << ' ' << score[t][i] << '\n';

        for (int mask=0; mask<(1<<n); ++mask) {
            for (int i=0; i<n; ++i) {
                if (mask & (1 << i)) scsum[t][mask] += score[t][i];
            }
        }
    }
    
    for (int i=0; i<n; ++i) cout << score[T][i] << '\n';
}

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

    cout << fixed << setprecision(15);
    solve();
}