#include<iostream>
#include<sstream>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<complex>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cassert>

#define rep(i,n) for(int i=0;i<(int)n;i++)
#define all(c) (c).begin(),(c).end()
#define mp make_pair
#define pb push_back
#define each(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();i++)
#define dbg(x) cerr<<__LINE__<<": "<<#x<<" = "<<(x)<<endl

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
const int inf = (int)1e9;
const double INF = 1e12, EPS = 1e-9;

int n, m, l, p[100], t[100], v[100];
double dp[100][52], sum[100][52];

int main(){
	cin >> n >> m >> l;
	rep(i, n) cin >> p[i] >> t[i] >> v[i];
	rep(i, n){
		dp[i][0] = 1;
		rep(j, m) for(int k = m; k >= 0; k--){
			dp[i][k + 1] += dp[i][k] * p[i] / 100.0;
			dp[i][k] *= 1 - p[i] / 100.0;
		}
		sum[i][m] = dp[i][m];
		for(int j = m - 1; j >= 0; j--) sum[i][j] = sum[i][j + 1] + dp[i][j];
		/*
		rep(j, m + 1) cerr<<dp[i][j]<<(j==m?"\n":" ");
		rep(j, m + 1) cerr<<sum[i][j]<<(j==m?"\n":" ");
		*/
	}
	
	rep(i, n){
		double s = 0;
		if(v[i]) rep(j, m + 1){
			double e = dp[i][j];
			rep(k, n) if(k != i){
				int tm = (int)ceil((l * 1.0 / v[i] - l * 1.0 / v[k] + t[i] * j) / t[k] + EPS);
				
				tm = max(tm, 0);
				if(t[k] == 0) tm = l * 1.0 / v[i] - l * 1.0 / v[k] + t[i] * j < - EPS ? 0 : m + 1;
				if(v[k] == 0) tm = 0;
				if(tm <= m) e *= sum[k][tm];
				else e = 0;
			}
			s += e;
		}
		printf("%.9f\n", s);
	}
	
	return 0;
}