#include<iostream>
#include<vector>
#include<string>
#include<algorithm>	
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
using namespace std;
//kaewasuretyuui
typedef long long ll;
typedef int Def;
typedef pair<Def,Def> pii;
typedef vector<Def> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<Def,pii> pip;
typedef vector<pip>vip;
#define mt make_tuple
typedef tuple<double,int,double> tp;
typedef vector<tp> vt;
const double PI=acos(-1);
const double EPS=1e-7;
const int inf=1e9;
const ll INF=2e18;
int dx[]={0,1,0,-1};
int dy[]={1,0,-1,0};
int main(){
	int n,m;
	double l;
	cin>>n>>m>>l;
	vt in;
	rep(i,n){
		double a,b,c;
		cin>>a>>b>>c;
		a/=100;
		double sum=0;
		vd dp(200);
		dp[100]=1;
		rep(j,m){
			vd ndp(200);
			rep(k,200)if(dp[k]>0){
				ndp[k+1]+=dp[k]*a;
				ndp[k-1]+=dp[k]*(1-a);
			}
			dp=ndp;
		}
		rep(j,m+1){
			sum=dp[100-m+2*j];
			if(c)in.pb(tp(l/c+j*b,i,sum));
			else in.pb(tp(inf,i,sum));
		}
	}
	sort(all(in));
	vd out(n);
//	double t=1;
	vd t(n,1);
	rep(i,in.size()){
		double a,c;int b;
		tie(a,b,c)=in[i];
//		cout<<shosu(4)<<a<<" "<<b<<" "<<c<<endl;
		vt tmp;
		tmp.pb(in[i]);
		t[b]-=c;
		while(i!=in.size()-1){
			double d,f;int e;
			tie(d,e,f)=in[i+1];
			if(abs(a-d)<EPS){
				i++;
				tmp.pb(in[i]);
				t[e]-=f;
			}else break;
		}
//		rep(j,t.size())cout<<" "<<t[j];cout<<endl;
		rep(j,tmp.size()){
			double d,f;int e;
			tie(d,e,f)=tmp[j];
			double sum=f;
			rep(k,n)if(k!=e)sum*=t[k];
			out[e]+=sum;
		}
//		cout<<t<<endl;
	}
	rep(i,n)cout<<shosu(9)<<out[i]<<endl;
}