class Integer
  def combination(k)
    self.factorial/(k.factorial*(self-k).factorial)
  end

  def factorial
    return 1 if self == 0
    (1..self).inject(:*)
  end
end

def upper_bound(arr, v)
  l = -1
  r = arr.size
  while l + 1 < r
    m = (l + r) / 2
    if arr[m] <= v then l = m
    else r = m
    end
  end
  r
end

EPS = 1e-9
n, m, l = gets.split.map(&:to_i)
p, t, v = n.times.map{ gets.split.map(&:to_i) }.transpose

time_set = n.times.map{ [0] * (m + 1) }
prob_set = n.times.map{ [0] * (m + 1) }
n.times do |i|
  s = v[i] == 0 ? Float::INFINITY : l / v[i].to_f
  (m + 1).times do |j|
    time_set[i][j] = s + t[i] * j
    prob_set[i][j] = ((p[i] / 100.0) ** j) * ((1 - p[i] / 100.0) ** (m - j)) * m.combination(j)
  end
end

prob_sum = prob_set.map{ |ps| ps.reverse.each_with_object([0]){ |p, arr| arr << arr[-1] + p }[1..-1].reverse }

n.times do |i|
  ret = 0
  (m + 1).times do |j|
    prob = prob_set[i][j]
    n.times do |k|
      next if i == k
      idx = upper_bound(time_set[k], time_set[i][j] + EPS)
      if idx == m + 1
        prob = 0
        break
      end
      prob *= prob_sum[k][idx]
    end
    ret += prob
  end
  puts '%.8f' % ret
end