#include <bits/stdc++.h>

#define REP(i,n) for(int i=0;i<(int)(n);i++)

using namespace std;

typedef long double ld;

int main() {
  int n,m;
  double l;
  cin>>n>>m>>l;
  vector<vector<ld>> prob(n, vector<ld>(m+1));
  vector<vector<ld>> tm(n, vector<ld>(m+1));
  REP(i,n) {
    ld p,t,v;
    cin>>p>>t>>v;
    p /= 100.0;
    prob[i][0] = 1.0;
    REP(j,m) {
      vector<ld> tmp(m+1);
      tmp[0] = prob[i][0] * (1-p);
      REP(k,m)
        tmp[k+1] = prob[i][k] * p + prob[i][k+1] * (1-p);
      swap(prob[i], tmp);
    }
    REP(j,m+1)
      tm[i][j] = l/v + t*j;
  }
  REP(i,n) {
    ld psum = 0.0;
    REP(j,m+1) {
      ld T = tm[i][j];
      ld p = prob[i][j];
      REP(k,n) {
        if(i==k) continue;
        ld sp = 0.0;
        REP(l,m+1){
          if (tm[k][l] > T) sp += prob[k][l];
        }
        p *= sp;
      }
      psum += p;
    }
    cout << setprecision(10) << fixed << psum << endl;
  }
  return 0;
}