import sys

import numpy as np



N = int(eval(input()))

T, A = list(map(int, input().split()))

H = np.array(list(map(int, input().split())))



m = abs(A - (T - 0.006 * H[0]))

num = 1



for n in range(1, N):

    d = abs(A - (T - 0.006 * H[n]))

    if d < m:

        m = d

        num = n+1



print(num)

N = int(eval(input()))

T, A = list(map(int, input().split()))

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



pt = [abs(A - (T - h * 0.006)) for h in H]



# np.argsortなしで，最大値，最小値のindexを取得

ans = min(enumerate(pt), key=lambda x: x[1])[0]

print((ans + 1))



# 最大値が複数あるとき

# [i for i, v in enumerate(li) if v == max(l)]

# 計算重そう



import sys
import numpy as np

N = int(eval(input()))
T, A = list(map(int, input().split()))
H = np.array(list(map(int, input().split())))
m = abs(A - (T - 0.006 * H[0]))
num = 1
for n in range(1, N):
    d = abs(A - (T - 0.006 * H[n]))
    if d < m:
        m = d
        num = n + 1
print(num)

N = int(eval(input()))
T, A = list(map(int, input().split()))
H = list(map(int, input().split()))
pt = [abs(A - (T - h * 0.006)) for h in H]
# np.argsortなしで，最大値，最小値のindexを取得
ans = min(enumerate(pt), key=lambda x: x[1])[0]
print((ans + 1))
# 最大値が複数あるとき
# [i for i, v in enumerate(li) if v == max(l)]
# 計算重そう

-import sys -import numpy as np - -H = np.array(list(map(int, input().split()))) -m = abs(A - (T - 0.006 * H[0])) -num = 1 -for n in range(1, N): -    d = abs(A - (T - 0.006 * H[n])) -    if d < m: -        m = d -        num = n + 1 -print(num) +H = list(map(int, input().split())) +pt = [abs(A - (T - h * 0.006)) for h in H] +# np.argsortなしで，最大値，最小値のindexを取得 +ans = min(enumerate(pt), key=lambda x: x[1])[0] +print((ans + 1)) +# 最大値が複数あるとき +# [i for i, v in enumerate(li) if v == max(l)] +# 計算重そう