Problem: Everybody knows that the capital of Berland is connected to Bercouver (the Olympic capital) by a direct road. To improve the road's traffic capacity, there was placed just one traffic sign, limiting the maximum speed. Traffic signs in Berland are a bit peculiar, because they limit the speed only at that point on the road where they are placed. Right after passing the sign it is allowed to drive at any speed.

It is known that the car of an average Berland citizen has the acceleration (deceleration) speed of a km/h2, and has maximum speed of v km/h. The road has the length of l km, and the speed sign, limiting the speed to w km/h, is placed d km (1 ≤ d < l) away from the capital of Berland. The car has a zero speed at the beginning of the journey. Find the minimum time that an average Berland citizen will need to get from the capital to Bercouver, if he drives at the optimal speed.

The car can enter Bercouver at any speed.

Input

The first line of the input file contains two integer numbers a and v (1 ≤ a, v ≤ 10000). The second line contains three integer numbers l, d and w (2 ≤ l ≤ 10000; 1 ≤ d < l; 1 ≤ w ≤ 10000).

Output

Print the answer with at least five digits after the decimal point.

Examples

Input

1 1
2 1 3


Output

2.500000000000


Input

5 70
200 170 40


Output

8.965874696353

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
double distance(double v, double a, double t) { return v * t + a * t * t / 2; }
double time(double v, double a, double d) {
  return (-v + sqrt(v * v + 2 * a * d)) / a;
}
int main(int argc, char* argv[]) {
  cout.precision(16);
  double a, v, l, d, w;
  cin >> a >> v >> l >> d >> w;
  double t = 0;
  double p = (w * w + 2 * a * d) / (4 * a);
  if (p <= d) {
    if (sqrt(2 * p * a) <= v)
      t += sqrt(2 * p * a) / a + (sqrt(2 * p * a) - w) / a;
    else
      t +=
          v / a +
          (d - distance(0, a, v / a) - distance(v, -a, max(0.0, (v - w) / a))) /
              v +
          max(0.0, (v - w) / a);
    if (d + distance(w, a, max(0.0, (v - w) / a)) < l)
      t += max(0.0, (v - w) / a) +
           (l - d - distance(w, a, max(0.0, (v - w) / a))) / v;
    else
      t += time(w, a, l - d);
  } else {
    if (distance(0, a, v / a) < l)
      t += v / a + (l - distance(0, a, v / a)) / v;
    else
      t += time(0, a, l);
  }
  cout << t << endl;
  return 0;
}