#define _CRT_SECURE_NO_WARNINGS
//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
#define all(c) (c).begin(), (c).end()
#define loop(i,a,b) for(ll i=a; i<ll(b); i++)
#define rep(i,b) loop(i,0,b)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
template<class T> istream & operator>>(istream & is, vector<T> &);
template<class T> ostream & operator<<(ostream & os, vector<T> const &);
template<int n, class...T> typename enable_if<(n>=sizeof...(T))>::type _ot(ostream &, tuple<T...> const &){}
template<int n, class...T> typename enable_if<(n< sizeof...(T))>::type _ot(ostream & os, tuple<T...> const & t){ os << (n==0?"":" ") << get<n>(t); _ot<n+1>(os, t); }
template<class...T> ostream & operator<<(ostream & os, tuple<T...> const & t){ _ot<0>(os, t); return os; }
template<int n, class...T> typename enable_if<(n>=sizeof...(T))>::type _it(istream &, tuple<T...> &){}
template<int n, class...T> typename enable_if<(n< sizeof...(T))>::type _it(istream & is, tuple<T...> & t){ is >> get<n>(t); _it<n+1>(is, t); }
template<class...T> istream & operator>>(istream & is, tuple<T...> & t){ _it<0>(is, t); return is; }
template<class T, class U> istream & operator<<(istream & is, pair<T,U> & p){ return is >> p.first >> p.second; }
template<class T, class U> ostream & operator<<(ostream & os, pair<T,U> const & p){ return os << "(" << p.first << ", " << p.second << ") "; }
template<class T> istream & operator>>(istream & is, vector<T> & v){ rep(i,v.size()) is >> v[i]; return is; }
template<class T> ostream & operator<<(ostream & os, vector<T> const & v){ rep(i,v.size()) os << v[i] << (i+1==(int)v.size()?"":" "); return os; }
#ifdef DEBUG
#define dump(...) (cerr<<#__VA_ARGS__<<" = "<<mt(__VA_ARGS__)<<" ["<<__LINE__<<"]"<<endl)
#else
#define dump(...)
#endif

const int MAX_N = 10000; //400MB
// const int MAX_N = 1024; // 4MB
// nCr % mod
ll nCr(int n, int r){
    static bool done[MAX_N+1][MAX_N/2+2];
    static ll dp[MAX_N+1][MAX_N/2+2]; // 400MB
    if (n < 0 || r < 0 || n < r) return 0;
    if (r==0) return 1;
    if (r > n-r) r = n-r;
    ll &res = dp[n][r];
    if (done[n][r]) return res;
    done[n][r] = true;
    return res = (nCr(n-1,r-1)+nCr(n-1,r));
}

int N,M;
double L;
double P[120], T[120], V[120];

double dp[110][60];
double f(int i, int k){
    double res = dp[i][k];
    if(res==-1) res = nCr(M,k)*pow(P[i],k)*pow(1-P[i],M-k);
    return res;
}

int main(){
    while(cin >> N >> M >> L){
        rep(i,N)rep(j,M+1) dp[i][j] = -1;
        rep(i,N){
            cin >> P[i] >> T[i] >> V[i];
            P[i]/=100;
        }
        rep(i,N){
            double ans = 0;
            rep(j,M+1){
                double t = L/V[i]+j*T[i];
                double x = 1;
                rep(ii,N)if(i!=ii){
                    double y = 0;
                    rep(jj,M+1){
                        double tt = L/V[ii]+jj*T[ii];
                        if(t<tt && abs(t-tt)>1e-10){
                            y += f(ii,jj);
                        }
                    }
                    x*=y;
                }
                ans += x*f(i,j);
            }
            printf("%.10lf\n", ans);
        }
    }
}

Measured memory_bytes: 5648