#include <stdio.h>
#include <cmath>
#include <algorithm>
#include <cfloat>
#include <stack>
#include <queue>
#include <vector>
#include <string>
#include <iostream>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;

struct Info{
	double P,T,V;
};

int calc(int x,int y){
	if(y == 0){
		return x;
	}else{
		return calc(y,x%y);
	}
}

int main(){

	int N,M;
	double L;

	scanf("%d %d %lf",&N,&M,&L);


	int mCk[M+1][M+1];
	for(int i = 0; i <= M; i++){
		for(int k = 0; k <= M; k++)mCk[i][k] = 1;
	}

	int bunshi[51],bunbo[51],common;

	for(int k = 0; k <= M; k++){

		for(int a = 0; a < k; a++)bunshi[a] = (M-a);
		for(int a = 0; a < k; a++)bunbo[a] = (k-a);

		for(int shita = 0; shita < k; shita++){
			for(int ue = 0; ue < k; ue++){

				if(bunshi[ue] >= bunbo[shita]){
					common = calc(bunshi[ue],bunbo[shita]);
				}else{
					common = calc(bunbo[shita],bunshi[ue]);
				}
				bunshi[ue] /= common;
				bunbo[shita] /= common;
			}
		}

		for(int a = 0; a < k; a++)mCk[k][a] = bunshi[a];
	}

	Info info[N];

	for(int i = 0; i < N; i++){
		scanf("%lf %lf %lf",&info[i].P,&info[i].T,&info[i].V);
		info[i].P /= 100.0;
	}

	double time[N][M+1];

	for(int i = 0; i < N; i++){
		for(int k = 0; k <= M; k++){
			time[i][k] = L/info[i].V + k*info[i].T;
		}
	}

	double table[N][M+1],base;

	for(int i = 0; i < N; i++){
		for(int k = 0; k <= M; k++){
			base = 1.0;
			for(int a = 0; a < k; a++){
				base *= info[i].P;
			}
			for(int a = 0; a < M-k; a++){
				base *= (1.0-info[i].P);
			}
			for(int a = 0; a < k; a++){
				base *= mCk[k][a];
			}
			table[i][k] = base;
		}
	}


	double win,base_time,tmp,tmp2;
	bool FLG;

	for(int i = 0; i < N; i++){
		win = 0.0;

		FLG = true;
		for(int k = 0; k <= M; k++){

			base_time = time[i][k];
			tmp = 1.0;
			for(int enemy = 0; enemy < N; enemy++){
				if(enemy == i)continue;

				FLG = false;
				tmp2 = 0.0;
				for(int a = 0; a <= M; a++){
					if(time[enemy][a] > base_time){
						tmp2 += table[enemy][a];
						FLG = true;
					}
				}
				if(!FLG)break;
				tmp *= tmp2;
			}
			if(!FLG){
				break;
			}else{
				win += table[i][k]*tmp;
			}
		}
		printf("%.8lf\n",win);
	}

	return 0;
}