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

typedef unsigned uint;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii> vpii;
typedef complex<double> cmplx;
template <typename T> using minPq = priority_queue<T, vector<T>, greater<T>>;
#define boost() cin.sync_with_stdio(0); cin.tie(0)
#define ms(a, x) memset(a, x, sizeof(a))
#define pb push_back
#define fs first
#define sn second
#define ALL(v) (v).begin(), (v).end()
#define SZ(v) ((int) (v).size())
#define lbv(v, x) (lower_bound((v).begin(), (v).end(), x) - (v).begin())
#define ubv(v, x) (upper_bound((v).begin(), (v).end(), x) - (v).begin())
template <typename T> inline void UNIQUE(vector<T> &v){sort(ALL(v)); v.resize(unique(ALL(v)) - v.begin());}
const int INF = 0x3f3f3f3f;
const ll LLINF = 0x3f3f3f3f3f3f3f3f;
const double PI = acos(-1);
#define FR(i, n) for(int i = 0; i < (n); i++)
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define FORR(i, a, b) for(int i = (a); i >= (b); i--)
#define dbg(x) {cerr << #x << ' ' << x << endl;}
#define dbgArr(arr, n) {cerr << #arr; FR(_i, n) cerr << ' ' << arr[_i]; cerr << endl;}

const int MN = 17;
const int PW = 1<<MN;
const int MT = 101;

int n, t, pw;
int rrr[MN], crr[MN];
double dif[MN];

double dp[MT][PW];
double solved[MT][MN];

int main(){
    boost();
    cin >> n >> t;
    pw = 1 << n;
    FR(i, n) cin >> rrr[i] >> crr[i] >> dif[i];
    dp[0][pw-1] = 1;

    FR(i, t){
        FOR(s, 1, pw){
            if(dp[i][s] == 0) continue;
            double solveSum = 0;
            FR(j, n) solveSum += solved[i][j] * ((s >> j) & 1);

            vector<double> tryCh(n);
            if(solveSum) FR(j, n) tryCh[j] = solved[i][j]/solveSum * ((s >> j) & 1);
            else {
                int pop = __builtin_popcount(s);
                FR(j, n) tryCh[j] = double((s >> j) & 1) / pop;
            }

            //dbg(s);
            //dbgArr(tryCh.begin(), SZ(tryCh));

            FR(j, n){
                double chNoSolve = dp[i][s] * tryCh[j] * (1-dif[j]);
                double chSolve = dp[i][s] * tryCh[j] * dif[j];

                if(i + rrr[j] <= t) dp[i+rrr[j]][s^(1<<j)] += chNoSolve;
                if(i + rrr[j] + crr[j] <= t){
                    dp[i+rrr[j]+crr[j]][s^(1<<j)] += chSolve;
                    solved[i+rrr[j]+crr[j]][j] += chSolve;
                }
            }
        }

        FR(j, n) solved[i+1][j] += solved[i][j];
    }

    cout << fixed << setprecision(9);
    FR(i, n) cout << solved[t][i] << '\n';
}