#include <bits/stdc++.h>
using namespace std;

typedef vector<int> vi;
typedef vector<double> vd;

double mypow(double b ,int e){
	  if(e == 0) return 1;
	  if(e%2==0)
			return mypow( b*b, e/2 );
	  else
			return mypow( b*b, e/2 ) * b;
}

int main(){


	  int N,M,L; cin >> N >> M >> L ;
	  if(N==1){
			cout << 1.0 << endl;
			return 0;
	  }
	  vector<vd> prob(N,vd(M+1,0.0));
	  vector<vd> dist(N,vd(M+1,0.0));

	  vd p(N),t(N),v(N);
	  for(int i=0; i<N; i++)	cin >> p[i] >> t[i] >> v[i];

	  // PRE PROCESS
	  for(int i=0; i<N; i++){
			dist[i][0] = (double)L / v[i];
			for(int j=1; j<=M; j++){
				  dist[i][j] = dist[i][j-1] + t[i];
			}
	  }
	  for(int i=0; i<N; i++)
			prob[i][0] = mypow((100-p[i])/100,M);
	  for(int i=0; i<N; i++){
			for(int j=1; j<=M; j++){
				  if(p[i] != 100)
						prob[i][j] = (prob[i][j-1] * (p[i]/100)) / ((100-p[i])/100);
				  else
						prob[i][j] = 1.0;
			}
	  }
	  double comb = 1;
	  for(int j=1; j<=M; j++){
			comb = comb * (M - j + 1) / j; 
			for(int i=0; i<N; i++){
				  prob[i][j] *= comb;
			}
	  }
	  
	  vector<vd> sum = prob;
	  for(int i=0; i<N; i++){
			for(int j=M-1; j>=0; j--){
				  sum[i][j] += sum[i][j+1];
				  if(sum[i][j] > 1) sum[i][j] = 1;
			}
	  }

	  vector<vd> ans = prob;
	  for(int i=0; i<N; i++){
			for(int j=0; j<=M; j++){
				  for(int k=0; k<N; k++){
						if(i==k) continue;
						int id = upper_bound(dist[k].begin(),dist[k].end(), dist[i][j]) - dist[k].begin();
						if(id > M) ans[i][j] = 0.0;
						else 	   ans[i][j] *= sum[k][id];

				  }
			}
	  }

	  for(int i=0; i<N; i++){
			double tmp = 0.0;
			if(p[i] == 100) tmp = ans[i][M];
			else
				  for(int j=0; j<=M; j++)
						tmp += ans[i][j];
			if(tmp > 1) tmp = 0;
			printf("%.10f\n",tmp);
	  }
						
}