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

#define ll long long
#define all(x) x.begin(), x.end()
#define pb push_back
#define f first
#define s second

#define vi vector<int>
#define pi pair<int,int>
#define lb lower_bound
#define FOR(i,a,b) for(int i=a;i<b;i++)
#define For(i,a) FOR(i,0,a)
#define trav(a,b) for(auto& a:b)
#define ROF(i,a,b) for(int i=b-1;i>=a;i--)
#define sz(x) (int) x.size()
#define ld long double
#define vpi vector<pi>
#define pil pair<int, ld>
#define vpil vector<pil>

const int MX = 1e2+3;
const int MX2 = (1<<17) + 1;

ld fre[MX][MX2];
ld ans[18]; // current probabilities of solved
int r[20], c[20];
ld p[20];
ld upd_ans[MX][20];

// const ld eps=0.0001;
const ld eps=1e-12;

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    if (fopen("input.in", "r")) {
        freopen("input.in", "r", stdin);
        freopen("output.out", "w", stdout);
    }

    cout<<fixed<<setprecision(30);
    int n,T;cin>>n>>T;
    fre[0][0] = 1;
    For(i,n) {
        cin>>r[i]>>c[i]>>p[i];
        assert(p[i]<=1);
    }

    // cout << "HI" << endl;
    FOR(t,0,T+1) {
        For(k,n) {
            ans[k] += upd_ans[t][k];
            assert(ans[k]<=1);
        }

        For(mask, 1<<n) if (fre[t][mask]>=eps) {
            ld tot_ans = 0;
            int tmp_cnt=0;
            For(k,n) if(((1<<k) & mask) == 0) {
                tot_ans += ans[k];
                tmp_cnt++;
            }
            For(k,n) if(((1<<k) & mask) == 0) {
                ld prob_will_read = (ld) 1/tmp_cnt;
                if(tot_ans>=eps) {
                    prob_will_read = ans[k]/tot_ans;
                }
                if (t+r[k] <= T) {
                    ld tmp = prob_will_read*fre[t][mask];
                    if(t+r[k]+c[k] <= T) {
                        upd_ans[t+r[k]+c[k]][k] += tmp * p[k];
                        fre[t+r[k]+c[k]][mask+(1<<k)] += tmp * p[k];
                    }
                    fre[t+r[k]][mask+(1<<k)] += tmp*(1-p[k]);

                }
            }
        }
    }
    // TODO: setprecision
    // cout << fix
    For(i,n) {
        cout << ans[i] << "\n";
    }

}

/**
 For(mask, 1<<n) trav(x, upd_read[t][mask]) {
            // go solve 
            int k = x.f;
            // + instead of | works too rt
            if(t+c[k] <= T)
                upd_solve[t+c[k]][mask+(1<<k)].pb({k, p[k]*x.s});
            // no solve
            fre[t][mask+(1<<k)] += (1-p[k])*x.s;
        }
        cout << "HI2" << endl;
        For(mask, 1<<n) trav(x, upd_solve[t][mask]) {
            ans[x.f] += x.s;
            fre[t][mask] += x.s;
        }
        cout << "HI3" << endl;
*/