#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using pii = pair<int,int>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<typename T> T uid(T x, T y) {return uniform_int_distribution<T>(x,y)(rng);}
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v) {os << "["; for (int i = 0; i < v.size(); i++) {if (i) os << ", "; os << v[i];} return os << "]";};
template<typename T, typename U> ostream& operator<<(ostream &os, const pair<T,U> &x) {return os << "(" <<x.first << ", " << x.second << ")";};
template<typename T> void pv(T a, T b, string s = "") {cerr << "["; for (T i = a; i != b; ++i) {if (i != a) cerr << ", "; cerr << *i;} cerr << "] " << s << "\n";}
template<typename... T> void dbg(T... t) {initializer_list<int>{(cerr << t << " ", 0)...}; cerr << "\n";}
template<typename T, typename U> void chmin(T& t, U u) {if (t > u) t = u;}
template<typename T, typename U> void chmax(T& t, U u) {if (t < u) t = u;}
#define bug(x...) cerr << "[" << #x << "] = ", dbg(x)
#define fi first
#define se second
#define SZ(x) ((int)((x).size()))
using ld = double;
const int mxn = 17, mxt = 105;
ld dp[mxt*3][1<<mxn], amt[mxt*3][mxn], camt[mxt*3][mxn];
struct prob {
    int r, c;
    ld p;
} P[mxn];
void solve() {
    int n,t;
    cin >> n >> t;
    for (int q = 0; q < n; q++) {
        cin >> P[q].r >> P[q].c >> P[q].p;
    }
    dp[0][0] = 1; // dp[i][j] = prop that have read mask j by time i and are ready to read at i+1
    for (int q = 1; q < mxt; q++) {
        for (int w = 0; w < n; w++) {
            if (q-2 >= 0) camt[q-1][w] = camt[q-2][w]+amt[q-1][w];
        }
        for (int w = 0; w < (1<<n); w++) {
            ld tot = 0;
            int no = 0;
            for (int e = 0; e < n; e++) {
                if (((w>>e)&1) == 0) {
                    tot += camt[q-1][e];
                    no++;
                }
            }
            for (int e = 0; e < n; e++) {
                if (((w>>e)&1) == 0) {
                    ld ps, pns;
                    if (tot == 0) {
                        ps = dp[q-1][w]/no*P[e].p;
                        pns = dp[q-1][w]/no*(1-P[e].p);
                    } else {
                        ps = dp[q-1][w]*camt[q-1][e]/tot*P[e].p;
                        pns = dp[q-1][w]*camt[q-1][e]/tot*(1-P[e].p);
                    }
                    dp[q+P[e].r+P[e].c-1][w^(1<<e)] += ps;
                    dp[q+P[e].r-1][w^(1<<e)] += pns;
                    amt[q+P[e].r+P[e].c-1][e] += ps;
                }
            }
        }
    }
    for (int q = 0; q < n; q++) {
        cout << fixed << setprecision(15) << camt[t][q] << '\n';
    }
}
int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int t = 1;
//    cin >> t;
    for (int q = 1; q <= t; q++) {
        solve();
    }
    return 0;
}