Problem: The New Year celebrations in Berland last n days. Only this year the winter is snowless, that’s why the winter celebrations’ organizers should buy artificial snow. There are m snow selling companies in Berland. Every day the i-th company produces wi cubic meters of snow. Next day the snow thaws and the company has to produce wi cubic meters of snow again. During the celebration new year discounts are on, that’s why the snow cost decreases every day. It is known that on the first day the total cost of all the snow produced by the i-th company is equal to ci bourles. Every day this total cost decreases by ai bourles, i.e. on the second day it is equal to ci - ai,and on the third day — to ci - 2ai, and so on. It is known that for one company the cost of the snow produced by it does not get negative or equal to zero. You have to organize the snow purchase so as to buy every day exactly W snow cubic meters. At that it is not necessary to buy from any company all the snow produced by it. If you buy ni cubic meters of snow (0 ≤ ni ≤ wi, the number ni is not necessarily integer!) from the i-th company at one of the days when the cost of its snow is equal to si, then its price will total to <image> bourles. During one day one can buy the snow from several companies. In different days one can buy the snow from different companies. It is required to make the purchases so as to spend as little money as possible. It is guaranteed that the snow produced by the companies will be enough.

Input

The first line contains integers n, m and W (1 ≤ n ≤ 100, 1 ≤ m ≤ 500000, 1 ≤ W ≤ 109) which represent the number of days, the number of companies and the amount of snow that needs to be purchased on every one of the n days. The second line contains m integers wi. The third line contains m integers ci. The fourth line contains m integers ai. All the numbers are strictly positive and do not exceed 109. For all the i the inequation ci - (n - 1)ai > 0 holds true. 

Output

Print a single number — the answer to the given problem. Print the answer in the format with the decimal point (even if the answer is integer, it must contain the decimal point), without "e" and without leading zeroes. The answer should differ with the right one by no more than 10 - 9.

Examples

Input

2 3 10
4 4 4
5 5 8
1 2 5


Output

22.000000000000000


Input

100 2 1000000000
999999998 999999999
1000000000 1000000000
1 1


Output

99999995149.999995249999991

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int MAX = 5e5 + 20;
const double esp = 1e-10;
struct node {
  long double first;
  int second;
  node() {}
  node(long double a, int b) : first(a), second(b) {}
  bool operator<(const node &b) const {
    if (first != b.first) return first < b.first;
    return second < b.second;
  }
};
long double pp[MAX];
int w[MAX], c[MAX], a[MAX];
long long ss[MAX];
int n, m, W;
long long intpart;
long double frac;
int an[MAX];
int main() {
  intpart = frac = 0;
  scanf("%d%d%d", &n, &m, &W);
  for (int i = 1; i <= m; ++i) scanf("%d", &w[i]);
  for (int i = 1; i <= m; ++i) scanf("%d", &c[i]);
  for (int i = 1; i <= m; ++i) scanf("%d", &a[i]);
  long long t1;
  for (int i = 1; i <= m; ++i) an[i] = i;
  for (int j = 1; j <= n; ++j) {
    if (j == 1) {
      for (int i = 1; i <= m; ++i) pp[i] = 1.0 * c[i] / w[i], ss[i] = c[i];
    } else {
      for (int i = 1; i <= m; ++i) {
        ss[i] = ss[i] - a[i];
        pp[i] = 1.0 * ss[i] / w[i];
      }
    }
    int l = 1, r = m, len, base, key, p, q;
    long long hh;
    int resi = W;
    while (l <= r) {
      len = r - l + 1;
      base = l + rand() % len;
      std::swap(an[base], an[r]);
      key = an[r];
      p = l - 1;
      hh = 0;
      for (q = l; q < r; ++q) {
        if (pp[an[q]] <= pp[key]) {
          std::swap(an[p + 1], an[q]);
          p++;
          hh += w[an[p]];
        }
      }
      p++;
      std::swap(an[p], an[r]);
      hh += w[an[p]];
      if (hh < resi) {
        for (int i = l; i <= p; ++i) intpart += ss[an[i]];
        l = p + 1;
        resi -= hh;
      } else {
        if (hh - w[an[p]] >= resi)
          r = p - 1;
        else {
          for (int i = l; i <= p - 1; ++i) intpart += ss[an[i]];
          t1 = resi - hh + w[an[p]];
          t1 *= ss[an[p]];
          intpart += t1 / w[an[p]];
          frac += 1.0 * (t1 % w[an[p]]) / w[an[p]];
          intpart += (long long)frac, frac = frac - (long long)frac;
          break;
        }
      }
    }
  }
  printf("%lld.", intpart + (long long)frac);
  frac = frac - (long long)frac;
  for (int i = 1; i <= 13; ++i) {
    frac *= 10;
    int j;
    for (j = 0; j <= 9; ++j) {
      if (j > (int)frac) break;
    }
    printf("%d", j - 1);
    frac -= j - 1;
  }
  return 0;
}