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 5.4.1) (judge verdict: Accepted)

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>

typedef struct {
	int t;
	int no;
} data_t;

data_t h[1000] = {0};

int sort_dec(const void *a, const void *b)
{
	int dta = ((data_t*)a)->t;
	int dtb = ((data_t*)b)->t;
//	printf("%d %d\n",dta, dtb);
	return (dta - dtb);
}

int main()
{
	int n = 0;
	int t = 0;
	int a = 0;
	int temp = 0;
	int i = 0;
	scanf("%d", &n);
	scanf("%d %d", &t, &a);
	a = a * 1000;
	t = t * 1000;
	for(i = 0; i < n; i++) {
		scanf("%d",&temp);
		h[i].t = abs((t - (temp * 6)) - a);
		h[i].no = i+1;
//		printf("%d %d\n", h[i].t, h[i].no);
	}

	qsort(h, n, sizeof(data_t), sort_dec);
	printf("%d\n",h[0].no);
	return 0;
}