#include <bits/stdc++.h>

using namespace std;

#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#define si(x) int(x.size())
template<class t>using vc=vector<t>;
template<class t>using vvc=vc<vc<t>>;
template<class t, class u>bool chmin(t &a, u b){
	if(a > b){ a = b; return true;}
	else return false;
}
template<class t, class u>bool chmax(t &a, u b){
	if(a < b){ a = b; return true;}
	else return false;
}
using vi=vc<int>;
#define a first
#define b second
#define mp make_pair
using pi=pair<int,int>;

const int inf=INT_MAX/2-100;

const int nmax=17;
const int tmax=105;

using ld=long double;
ld dp[tmax][1<<nmax];

void slv(){
	int n,t;cin>>n>>t;
	vc<pi> rc(n);
	vc<ld> can(n);
	rep(i,n){
		cin>>rc[i].a>>rc[i].b;
		cin>>can[i];
	}
	using P=pair<int,ld>;
	vvc<P> add(t+1);
	
	dp[0][0]=1;
	
	vc<ld> done(n);
	
	rep(i,t+1){
		for(auto [j,v]:add[i])done[j]+=v;
		if(i<t){
			rep(bit,(1<<n)-1)if(dp[i][bit]>0){
				ld tot=0;
				int cnt=0;
				rep(j,n)if(!(bit&1<<j)){
					tot+=done[j];
					cnt++;
				}
				rep(j,n)if(!(bit&1<<j)){
					ld prob=(tot==0?ld(1)/cnt:done[j]/tot)*dp[i][bit];
					{//not solve
						int nx=i+rc[j].a;
						if(nx<=t){
							dp[nx][bit|1<<j]+=prob*(1-can[j]);
						}
					}
					{//solve
						int nx=i+rc[j].a+rc[j].b;
						if(nx<=t){
							dp[nx][bit|1<<j]+=prob*can[j];
							add[nx].eb(j,prob*can[j]);
						}
					}
				}
			}
		}
	}
	
	rep(i,n)cout<<done[i]<<endl;
}

signed main(){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cout<<fixed<<setprecision(20);
	
	slv();
}