#pragma GCC optimize("O3")
#include <iostream>
using namespace std;
#include <vector>
#define pb push_back
template<class C> using vc=vector<C>;
#define For(i,a,b) for(int i=(a);i<(b);i++)
#define smax(a,b) a=max(a,b)
#define f first
#define s second
typedef double d;

d dp[301][1<<17], tot[301][17];
int r[17], c[17]; d p[17];
int main()
{
    cin.sync_with_stdio(0), cin.tie(0), cout.sync_with_stdio(0), cout.tie(0);
    int n,T; cin>>n>>T; For(i,0,n) cin>>r[i]>>c[i]>>p[i];
    dp[0][0]=1;
    For(t,0,T)
    {
        if(t) For(i,0,n) tot[t][i]+=tot[t-1][i];
        For(m,0,1<<n) if(dp[t][m])
        {
            d S=0; For(i,0,n) if(!((m>>i)&1)) S+=tot[t][i];
            if(!S)
            {
                int cnt=0; For(i,0,n) if(!((m>>i)&1)) cnt++;
                if(!cnt)
                {
                    dp[t+1][m]+=dp[t][m];
                    continue;
                }
                For(i,0,n) if(!((m>>i)&1))
                {
                    d x=dp[t][m]/cnt;
                    dp[t+r[i]+c[i]][m|(1<<i)]+=p[i]*x;
                    tot[t+r[i]+c[i]][i]+=p[i]*x;
                    dp[t+r[i]][m|(1<<i)]+=(1-p[i])*x;
                }
            }
            else
                For(i,0,n) if(!((m>>i)&1))
                {
                    d x=dp[t][m]*tot[t][i]/S;
                    dp[t+r[i]+c[i]][m|(1<<i)]+=p[i]*x;
                    tot[t+r[i]+c[i]][i]+=p[i]*x;
                    dp[t+r[i]][m|(1<<i)]+=(1-p[i])*x;
                }
        }
    }
    For(i,0,n) cout<<tot[T][i]+tot[T-1][i]<<'\n';
}