#include <bits/stdc++.h>
#define For(i, a, b) for(int (i)=(int)(a); (i)<(int)(b); ++(i))
#define rFor(i, a, b) for(int (i)=(int)(a)-1; (i)>=(int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef unsigned long long ulint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
template<class T> bool chmax(T &a, const T &b){if(a<b){a=b; return true;} return false;}
template<class T> bool chmin(T &a, const T &b){if(a>b){a=b; return true;} return false;}
template<class T> T div_floor(T a, T b){
    if(b < 0) a *= -1, b *= -1;
    return a>=0 ? a/b : (a+1)/b-1;
}
template<class T> T div_ceil(T a, T b){
    if(b < 0) a *= -1, b *= -1;
    return a>0 ? (a-1)/b+1 : a/b;
}

constexpr lint mod = 1000000007;
constexpr lint INF = mod * mod;
constexpr int MAX = 200010;

lint gcd(lint p, lint q){
    p = abs(p);
    q = abs(q);
    while(q){
        lint r = p % q;
        p = q;
        q = r;
    }
    return p;
}

typedef struct Fraction{
    lint n, d; // n / d

    Fraction(lint n_=0, lint d_=1): n(n_), d(d_){
        if(d == 0) n = (n < 0 ? -1 : 1);
        else{
            lint g = gcd(n, d);
            n /= g;
            d /= g;
        }
    }

    Fraction operator-() const{
        return Fraction(-n, d);
    }
    Fraction &operator+=(const Fraction &rhs){
        n = n * rhs.d + rhs.n * d;
        d = d * rhs.d;
        return *this = Fraction(n, d);
    }
    Fraction &operator-=(const Fraction &rhs){
        n = n * rhs.d - rhs.n * d;
        d = d * rhs.d;
        return *this = Fraction(n, d);
    }
    Fraction &operator*=(const Fraction &rhs){
        n = n * rhs.n;
        d = d * rhs.d;
        return *this = Fraction(n, d);
    }
    Fraction &operator/=(const Fraction &rhs){
        n = n * rhs.d;
        d = d * rhs.n;
        return *this = Fraction(n, d);
    }

    Fraction operator+(const Fraction &rhs) const{
        Fraction ret(*this);
        return ret += rhs;
    }
    Fraction operator-(const Fraction &rhs) const{
        Fraction ret(*this);
        return ret -= rhs;
    }
    Fraction operator*(const Fraction &rhs) const{
        Fraction ret(*this);
        return ret *= rhs;
    }
    Fraction operator/(const Fraction &rhs) const{
        Fraction ret(*this);
        return ret /= rhs;
    }

    bool operator==(const Fraction &rhs) const{
        return n == rhs.n && d == rhs.d;
    }
    bool operator!=(const Fraction &rhs) const{
        return !(*this == rhs);
    }

    bool operator<(const Fraction &rhs) const{
        return n * rhs.d < rhs.n * d;
    }
    bool operator>(const Fraction &rhs) const{
        return rhs < *this;
    }
    bool operator<=(const Fraction &rhs) const{
        return !(*this > rhs);
    }
    bool operator>=(const Fraction &rhs) const{
        return !(*this < rhs);
    }

}frac;

int main(){
    int n, m, L;
    scanf("%d%d%d", &n, &m, &L);

    double comb[m + 1][m + 1];
    rep(i, m + 1)rep(j, m + 1) comb[i][j] = 0;
    comb[0][0] = 1;
    rep(i, m)rep(j, i + 1){
        comb[i + 1][j] += comb[i][j];
        comb[i + 1][j + 1] += comb[i][j];
    }

    double prob[n][m + 1];
    Fraction time[n][m + 1];
    int p[n], t[n], v[n];
    rep(i, n){
        scanf("%d%d%d", &p[i], &t[i], &v[i]);
        rep(k, m + 1){
            time[i][k] = Fraction(L + k * t[i] * v[i], v[i]);
            prob[i][k] = comb[m][k] * pow((double)p[i] / 100, k) * pow(1 - (double)p[i] / 100, m - k);
        }
    }

    rep(i, n){
        double ans = 0;
        rep(k, m + 1){
            double tmp = prob[i][k];
            rep(j, n)if(i != j){
                double ttmp = 0;
                rep(l, m + 1){
                    if(time[i][k] < time[j][l]) ttmp += prob[j][l];
                }
                tmp *= ttmp;
            }
            ans += tmp;
        }
        printf("%.10lf\n", ans);
    }
}


Measured memory_bytes: 3612