#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define data dataa
using LL=long long;
using ULL=unsigned long long;
using LD=long double;
// const LD eps=1e-10;
LD rest[110][1<<17],solve[110][20],p[20],ans[20];
int n,t,r[20],c[20],a[20];
void work(int tim,int msk,int id,LD num)
{
    int nmsk=msk|(1<<(id-1));
    if(tim+r[id]<=t)rest[tim+r[id]][nmsk]+=num*(1-p[id]);
    if(tim+r[id]+c[id]<=t)rest[tim+r[id]+c[id]][nmsk]+=num*p[id],solve[tim+r[id]+c[id]][id]+=num*p[id];
}
int main()
{
    scanf("%d%d",&n,&t);
    rep(i,n)scanf("%d%d%Lf",&r[i],&c[i],&p[i]);
    rest[0][0]=1;
    for(int i=0;i<=t;i++)
    {
        rep(j,n)ans[j]+=solve[i][j];
        if(i==t)break;
        for(int j=0;j<(1<<n)-1;j++)
        {
            if(rest[i][j]==0)continue;
            int cnt=0;
            rep(k,n)if(!((j>>(k-1))&1))a[++cnt]=k;
            LD sum=0;
            rep(k,cnt)sum+=ans[a[k]];
            rep(k,cnt)work(i,j,a[k],rest[i][j]*(sum==0?1.L/cnt:ans[a[k]]/sum));
        }
    }
    rep(i,n)printf("%.10Lf\n",ans[i]);
    return 0;
}