{-# LANGUAGE BangPatterns, MultiWayIf #-}

import Control.Applicative
import Control.Monad
import Data.List
import Debug.Trace (traceShow, traceShowM)

import Data.Ord (comparing)

solve :: Int -> Int -> Int -> [Double] -> Int
solve n t a hs = fst . head $ sortBy (comparing snd) $ zip [1..] qs
  where
    ps = fmap (\h -> fromIntegral t - h * 0.006) hs
    qs = fmap (abs . subtract (fromIntegral a)) ps

main :: IO ()
main = do
    n <- readLn :: IO Int
    [t, a] <- fmap read . words <$> getLine
    hs <- fmap read . words <$> getLine
    print $ solve n t a hs