n = int(eval(input()))

t, a = list(map(int, input().split()))

h = list(map(int, input().split()))



min_tmp = 10 ** 5

index = 0

for i in range(n):

    tmp = abs(a - (t - 0.006 * h[i]))

    if tmp <= min_tmp:

        min_tmp = tmp

        index = i

    # print(tmp)

print((index + 1))

"""

半ば強引に二分探査で書いた。

"""

#入力

n = int(eval(input()))

t, a = list(map(int, input().split()))

h = list(map(int, input().split()))

h_not_sorted = h

h = sorted(h)

x = abs((t - a) / 0.006)



#二分探査

l = 0

r = n - 1

x_index = 0

while l + 1 != r :

    middle = (l + r) // 2

    if h[middle] == x:

        x_index = middle

        break

    elif h[middle] < x:

        x_index = middle + 1

        l = middle

    else:

        x_index = middle - 1

        r = middle





#x_indexが両橋の場合とそれ以外で場合わけ。

res = abs(a - (t - 0.006 * h[x_index]))

ans = x_index

flag_r = True 

flag_l = True

if x_index == n - 1:

    flag_r = False

elif x_index == 0:

    flag_l = False

else:

    pass



#x_indexの両橋と比較。x_indexが際数値でない可能性があるため。

if flag_r:

    if abs(a - (t - 0.006 * h[x_index + 1])) < res:

        res = abs(a - (t - 0.006 * h[x_index + 1]))

        ans += 1

if flag_l:

    if abs(a - (t - 0.006 * h[x_index - 1])) < res:

        res = abs(a - (t - 0.006 * h[x_index - 1]))

        ans -= 1



print((h_not_sorted.index(h[ans]) + 1))
n = int(eval(input()))
t, a = list(map(int, input().split()))
h = list(map(int, input().split()))
min_tmp = 10**5
index = 0
for i in range(n):
    tmp = abs(a - (t - 0.006 * h[i]))
    if tmp <= min_tmp:
        min_tmp = tmp
        index = i
    # print(tmp)
print((index + 1))

"""
半ば強引に二分探査で書いた。
"""
# 入力
n = int(eval(input()))
t, a = list(map(int, input().split()))
h = list(map(int, input().split()))
h_not_sorted = h
h = sorted(h)
x = abs((t - a) / 0.006)
# 二分探査
l = 0
r = n - 1
x_index = 0
while l + 1 != r:
    middle = (l + r) // 2
    if h[middle] == x:
        x_index = middle
        break
    elif h[middle] < x:
        x_index = middle + 1
        l = middle
    else:
        x_index = middle - 1
        r = middle
# x_indexが両橋の場合とそれ以外で場合わけ。
res = abs(a - (t - 0.006 * h[x_index]))
ans = x_index
flag_r = True
flag_l = True
if x_index == n - 1:
    flag_r = False
elif x_index == 0:
    flag_l = False
else:
    pass
# x_indexの両橋と比較。x_indexが際数値でない可能性があるため。
if flag_r:
    if abs(a - (t - 0.006 * h[x_index + 1])) < res:
        res = abs(a - (t - 0.006 * h[x_index + 1]))
        ans += 1
if flag_l:
    if abs(a - (t - 0.006 * h[x_index - 1])) < res:
        res = abs(a - (t - 0.006 * h[x_index - 1]))
        ans -= 1
print((h_not_sorted.index(h[ans]) + 1))

+""" +半ば強引に二分探査で書いた。 +""" +# 入力 -min_tmp = 10**5 -index = 0 -for i in range(n): -    tmp = abs(a - (t - 0.006 * h[i])) -    if tmp <= min_tmp: -        min_tmp = tmp -        index = i -    # print(tmp) -print((index + 1)) +h_not_sorted = h +h = sorted(h) +x = abs((t - a) / 0.006) +# 二分探査 +l = 0 +r = n - 1 +x_index = 0 +while l + 1 != r: +    middle = (l + r) // 2 +    if h[middle] == x: +        x_index = middle +        break +    elif h[middle] < x: +        x_index = middle + 1 +        l = middle +    else: +        x_index = middle - 1 +        r = middle +# x_indexが両橋の場合とそれ以外で場合わけ。 +res = abs(a - (t - 0.006 * h[x_index])) +ans = x_index +flag_r = True +flag_l = True +if x_index == n - 1: +    flag_r = False +elif x_index == 0: +    flag_l = False +else: +    pass +# x_indexの両橋と比較。x_indexが際数値でない可能性があるため。 +if flag_r: +    if abs(a - (t - 0.006 * h[x_index + 1])) < res: +        res = abs(a - (t - 0.006 * h[x_index + 1])) +        ans += 1 +if flag_l: +    if abs(a - (t - 0.006 * h[x_index - 1])) < res: +        res = abs(a - (t - 0.006 * h[x_index - 1])) +        ans -= 1 +print((h_not_sorted.index(h[ans]) + 1))