Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-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

B. Running Student

time limit per test

1 secondmemory limit per test

64 megabytesinput

standard inputoutput

standard outputAnd again a misfortune fell on Poor Student. He is being late for an exam.

Having rushed to a bus stop that is in point (0, 0), he got on a minibus and they drove along a straight line, parallel to axis *OX*, in the direction of increasing *x*.

Poor Student knows the following:

- during one run the minibus makes
*n*stops, the*i*-th stop is in point (*x*_{i}, 0) - coordinates of all the stops are different
- the minibus drives at a constant speed, equal to
*v*_{b} - it can be assumed the passengers get on and off the minibus at a bus stop momentarily
- Student can get off the minibus only at a bus stop
- Student will have to get off the minibus at a terminal stop, if he does not get off earlier
- the University, where the exam will be held, is in point (
*x*_{u},*y*_{u}) - Student can run from a bus stop to the University at a constant speed
*v*_{s}as long as needed - a distance between two points can be calculated according to the following formula:
- Student is already on the minibus, so, he cannot get off at the first bus stop

Poor Student wants to get to the University as soon as possible. Help him to choose the bus stop, where he should get off. If such bus stops are multiple, choose the bus stop closest to the University.

Input

The first line contains three integer numbers: 2 ≤ *n* ≤ 100, 1 ≤ *v*_{b}, *v*_{s} ≤ 1000. The second line contains *n* non-negative integers in ascending order: coordinates *x*_{i} of the bus stop with index *i*. It is guaranteed that *x*_{1} equals to zero, and *x*_{n} ≤ 10^{5}. The third line contains the coordinates of the University, integers *x*_{u} and *y*_{u}, not exceeding 10^{5} in absolute value.

Output

In the only line output the answer to the problem — index of the optimum bus stop.

Examples

Input

4 5 2

0 2 4 6

4 1

Output

3

Input

2 1 1

0 100000

100000 100000

Output

2

Note

As you know, students are a special sort of people, and minibuses usually do not hurry. That's why you should not be surprised, if Student's speed is higher than the speed of the minibus.

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Dec/11/2017 06:56:29 (c4).

Desktop version, switch to mobile version.

User lists

Name |
---|