Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
C. Chris and Road

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputAnd while Mishka is enjoying her trip...

Chris is a little brown bear. No one knows, where and when he met Mishka, but for a long time they are together (excluding her current trip). However, best friends are important too. John is Chris' best friend.

Once walking with his friend, John gave Chris the following problem:

At the infinite horizontal road of width *w*, bounded by lines *y* = 0 and *y* = *w*, there is a bus moving, presented as a convex polygon of *n* vertices. The bus moves continuously with a constant speed of *v* in a straight *Ox* line in direction of decreasing *x* coordinates, thus in time only *x* coordinates of its points are changing. Formally, after time *t* each of *x* coordinates of its points will be decreased by *vt*.

There is a pedestrian in the point (0, 0), who can move only by a vertical pedestrian crossing, presented as a segment connecting points (0, 0) and (0, *w*) with any speed not exceeding *u*. Thus the pedestrian can move only in a straight line *Oy* in any direction with any speed not exceeding *u* and not leaving the road borders. The pedestrian can instantly change his speed, thus, for example, he can stop instantly.

Please look at the sample note picture for better understanding.

We consider the pedestrian is hit by the bus, if at any moment the point he is located in lies strictly inside the bus polygon (this means that if the point lies on the polygon vertex or on its edge, the pedestrian is not hit by the bus).

You are given the bus position at the moment 0. Please help Chris determine minimum amount of time the pedestrian needs to cross the road and reach the point (0, *w*) and not to be hit by the bus.

Input

The first line of the input contains four integers *n*, *w*, *v*, *u* (3 ≤ *n* ≤ 10 000, 1 ≤ *w* ≤ 10^{9}, 1 ≤ *v*, *u* ≤ 1000) — the number of the bus polygon vertices, road width, bus speed and pedestrian speed respectively.

The next *n* lines describes polygon vertices in counter-clockwise order. *i*-th of them contains pair of integers *x*_{i} and *y*_{i} ( - 10^{9} ≤ *x*_{i} ≤ 10^{9}, 0 ≤ *y*_{i} ≤ *w*) — coordinates of *i*-th polygon point. It is guaranteed that the polygon is non-degenerate.

Output

Print the single real *t* — the time the pedestrian needs to croos the road and not to be hit by the bus. The answer is considered correct if its relative or absolute error doesn't exceed 10^{ - 6}.

Example

Input

5 5 1 2

1 2

3 1

4 3

3 4

1 4

Output

5.0000000000

Note

Following image describes initial position in the first sample case:

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Oct/25/2020 11:49:30 (f3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|