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

const int MAXTIME = 102 ;
const int MAXN = 17 ;

int n , t ;
int read[ MAXN ] ;
int code[ MAXN ] ;
double prob[ MAXN ] ;

double f[ MAXTIME ][ ( 1 << MAXN ) ] ;
double cnt[ MAXTIME ][ MAXN ] ;

vector < int > v[ ( 1 << MAXN ) ] ;

void solve ( ) {
    cin >> n >> t ;
    for ( int i = 0 ; i < n ; ++ i ) {
        cin >> read[ i ] >> code[ i ] >> prob[ i ] ;
    }
    for ( int mask = 0 ; mask < ( 1 << n ) ; ++ mask ) {
        for ( int i = 0 ; i < n ; ++ i ) {
            if ( ( mask & ( 1 << i ) ) == 0 ) {
                v[ mask ].push_back ( i ) ;
            }
        }
    }
    f[ 0 ][ 0 ] = 1.0 ;
    for ( int wh = 0 ; wh < t ; ++ wh ) {
        for ( int mask = 0 ; mask < ( 1 << n ) ; ++ mask ) {
            double sm = 0.0 ;
            int hh = 0 ;
            for ( auto x : v[ mask ] ) {
                sm += cnt[ wh ][ x ] ;
                ++ hh ;
            }
            for ( auto x : v[ mask ] ) { 
                double coef = cnt[ wh ][ x ] ;
                if ( sm > 0 ) { coef /= sm ; }
                else { coef = 1.0 ; coef /= hh ; }
                if ( wh + read[ x ] <= t ) { 
                    f[ wh + read[ x ] ][ mask + ( 1 << x ) ] += coef * ( 1.0 - prob[ x ] ) * f[ wh ][ mask ] ;
                }
                if ( wh + read[ x ] + code[ x ] <= t ) {
                    f[ wh + read[ x ] + code[ x ] ][ mask + ( 1 << x ) ] += coef * prob[ x ] * f[ wh ][ mask ] ;
                    cnt[ wh + read[ x ] + code[ x ] ][ x ] += coef * prob[ x ] * f[ wh ][ mask ] ;
                }
            }
        }
        for ( int i = 0 ; i < n ; ++ i ) {
            cnt[ wh + 1 ][ i ] += cnt[ wh ][ i ] ;
        }
    }
    for ( int i = 0 ; i < n ; ++ i ) {
        cout << fixed << setprecision ( 12 ) << cnt[ t ][ i ] << "\n" ;
    }
}

int main ( ) {
    ios_base :: sync_with_stdio ( false ) ;
    cin.tie ( NULL ) ;
    int t = 1 ; // cin >> t ; 
    while ( t -- ) { solve ( ) ; }
    return 0 ;
}