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

#define rep(i,x,y) for(int i=(x);i<(y);++i)
#define debug(x) #x << "=" << (x)

#ifdef DEBUG
#define _GLIBCXX_DEBUG
#define dump(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define dump(x)
#endif

typedef long long int ll;
typedef pair<int,int> pii;
//template<typename T> using vec=std::vector<T>;

const int inf=1<<30;
const long long int infll=1LL<<58;
const long double eps=1e-9;
const int dx[]={1,0,-1,0},dy[]={0,1,0,-1};

template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec){
    os << "[";
    for (const auto &v : vec) {
    	os << v << ",";
    }
    os << "]";
    return os;
}

void solve(){
    int n,m,l;
    cin >> n >> m >> l;
    vector<long double> p(n),t(n),v(n);
    rep(i,0,n){
        cin >> p[i] >> t[i] >> v[i];
        if(v[i]==0) v[i]=1e-12;
    }

    ll comb[51][51]={};
    rep(i,0,51){
        comb[i][i]=1;
        comb[i][0]=1;
    }
    rep(i,1,51) rep(j,1,i){
        if(i>0 and i>j) comb[i][j]+=comb[i-1][j];
        if(j>0) comb[i][j]+=comb[i-1][j-1];
    }

    vector<unordered_map<int,long double>> x(n);
    rep(i,0,n) rep(j,0,m+1) x[i][t[i]*j]+=powl((100-p[i])/100,m-j)*comb[m][j]*powl(p[i]/100,j);
    rep(i,0,n){
        long double s1=0;
        for(const auto& p1:x[i]){
            long double tmp=p1.second;
            rep(j,0,n){
                if(j==i) continue;
                long double s2=0;
                for(const auto& p2:x[j]) if(p2.first+l/v[j]>p1.first+l/v[i]) s2+=p2.second;
                tmp*=s2;
            }
            s1+=tmp;
        }
        cout << fixed << setprecision(8) << s1 << endl;
    }
}

int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);
    solve();
    return 0;
}