#include <algorithm>
#include <cmath>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <cassert>
#include <functional>

using namespace std;

#define LOG(...) printf(__VA_ARGS__)
//#define LOG(...)
#define FOR(i,a,b) for(int i=(int)(a);i<(int)(b);++i)
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(),(a).rend()
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define RSORT(c) sort((c).rbegin(),(c).rend())
#define CLR(a) memset((a), 0 ,sizeof(a))

typedef long long ll;
typedef unsigned long long ull;
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vb> vvb;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int dx[] = { -1, 0, 1, 0 }; const int dy[] = { 0, 1, 0, -1 };

struct UnionFind {
	vector<int> v;
	UnionFind(int n) : v(n)  { for (int i = 0; i < n; i++) v[i] = i; }
	int  find(int x)         { return v[x] == x ? x : v[x] = find(v[x]); }
	void unite(int x, int y) { v[find(x)] = find(y); }
};
ll conb(int a, int b) {
	ll p = 1;
	FOR(i, 1, b+1) {
		p = p*(a - i + 1) / i;
	}
	return p;
}


int main() {
	int n, m;
	double l;
	cin >> n >> m >> l;
	vector<vector<pair<double, double>>> goal(n,vector<pair<double,double>>(m+1));//time ,prob
	REP(i, n) {
		double pro,time,v;
		cin>> pro>> time>> v;
		pro /= 100.0;
		REP(j,m+1) {
			goal[i][j] = {l/v+time*(j),(double)conb(m,j)*pow(pro,j)*pow(1.0-pro,m-j)};
		}
	}
	REP(i, n) {
		double ans=0.0;
		REP(j, m+1) {
			double res=goal[i][j].second;
			bool win=true;
			REP(k, n) {
				if (i == k)
					continue;
				double res2=1.0;
				REP(l,m+1) {
					if (goal[i][j].first<goal[k][l].first-1e-9) {
						res *= res2;
						break;
					}
					else {
						res2 -= goal[k][l].second;
						if (l == m)
							win = false;
					}
				}
			}
			if(win)
			ans += res;
		}
		printf("%.8lf\n", ans);
	}
}