#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;

#define DO(n) for ( int ____n = n; ____n-->0; )
#define REP(i, n) for (int i=0;i<n;++i)
#define FOR(i, a, b) for (int i=a;i<b;++i)
#define DWN(i, b, a) for (int i=b-1;i>=a;--i)
#define REP_1(i, n) for (int i=1;i<=n;++i)
#define FOR_1(i, a, b) for (int i=a;i<=b;++i)
#define DWN_1(i, b, a) for (int i=b;i>=a;--i)
#define RST(A) memset(A, 0, sizeof(A))
#define FLC(A, x) memset(A, x, sizeof(A))

typedef double DB;

const int N = int(1e2) + 9, M = int(5e1) + 9;
DB p[N][M], sp[N][M], t[N], t0[N];
int n, m, l;

DB f(int i, DB ti){
    DB z = 1; REP(j, n) if (i != j){
        if (t0[j] + m*t[j] <= ti) return 0;
        REP(k, m+1) if (t0[j] + k*t[j] > ti){
            z *= (1 - sp[j][k]);
            break;
        }
    }
    return z;
}

int main(){

    while (~scanf("%d%d%d", &n, &m, &l)){

        RST(p); REP(i, n){
            int _p, v; scanf("%d%lf%d", &_p, &t[i], &v); t0[i] = (DB) l / v; DB pp = (DB) _p / 100;
            //cout <<" " << pp << endl;
            p[i][0] = 1; DO(m){
                DWN_1(j, m, 1) p[i][j] = p[i][j-1] * pp + p[i][j] * (1-pp);
                p[i][0] = p[i][0] * (1-pp);
            }

            REP_1(j, m) sp[i][j] = sp[i][j-1] + p[i][j-1];
        }

        REP(i, n){
            DB z = 0; REP(j, m+1) z += p[i][j] * f(i, t0[i] + t[i]*j);
            printf("%.9f\n", z);
        }
    }
}