Problem:
Score: 200 points

Problem Statement

A country decides to build a palace.

In this country, the average temperature of a point at an elevation of x meters is T-x \times 0.006 degrees Celsius.

There are N places proposed for the place. The elevation of Place i is H_i meters.

Among them, Princess Joisino orders you to select the place whose average temperature is the closest to A degrees Celsius, and build the palace there.

Print the index of the place where the palace should be built.

It is guaranteed that the solution is unique.

Constraints

1 \leq N \leq 1000

0 \leq T \leq 50

-60 \leq A \leq T

0 \leq H_i \leq 10^5

All values in input are integers.

The solution is unique.

Input

Input is given from Standard Input in the following format:

N
T A
H_1 H_2 ... H_N

Output

Print the index of the place where the palace should be built.

Sample Input 1

2
12 5
1000 2000

Sample Output 1

1

The average temperature of Place 1 is 12-1000 \times 0.006=6 degrees Celsius.

The average temperature of Place 2 is 12-2000 \times 0.006=0 degrees Celsius.

Thus, the palace should be built at Place 1.

Sample Input 2

3
21 -11
81234 94124 52141

Sample Output 2

3

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

# include <bits/stdc++.h>
using namespace std;
const int maxn=100000+50;
double s[maxn];
int main ()
{
	int n;
	long long T,A;
	cin>>n>>T>>A;
	for (int i=1;i<=n;++i)
	{
	 cin>>s[i];
     s[i]=fabs((T-s[i]*0.006)-A);	
	}
	int max=1<<30;
	int ans;
	for (int i=1;i<=n;++i)
	   	if (s[i]<max)
	   	  {
	   	   max=s[i];
		   ans=i;
		  }
	printf ("%d\n",ans);
return 0;	  
}