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 (GCC 9.2.1) (judge verdict: Wrong Answer)

#include <stdio.h>
#include <string.h>
int main(void)
{
  int a=0;int b=0;int c=0;int i=0;int j=0;int k=0;int p=0;int q=0;
  float x[1000]={0};
  float y[1000]={0};
  float z[1000]={0};
  scanf("%d",&a);
  scanf("%d",&b);
  scanf("%d",&c);
  while(i<a){
    scanf("%f",&x[i]);
    x[i]=b-(x[i]*0.006);
    ++i;
  }
  for(j=0;j<i;j++){
    y[j]=c-x[j];
  }
  memcpy(z,y,sizeof(y));
  for(p=0;p<i-1;p++){
    for(j=i-1;j>p;j--){
      if(y[i-1]>y[j]){
        k=y[j-1];
        y[j-1]=y[j];
        y[j]=k;
      }
    }
  }
  for(q=0;y[0]!=z[q];q++);
  printf("%d\n",q+1);
  return 0;
}