import java.util.Map;
import java.util.Scanner;
import java.util.TreeMap;

public class Main {
    public static void main(String[] args) {

        Scanner scanner = new Scanner(System.in);
        int N = scanner.nextInt();
        int T = scanner.nextInt();
        double A = (double) scanner.nextInt();

        Map<Integer, Double> map = new TreeMap<>();

        for (int i = 0; i < N; i++) {
            map.put(i + 1, Math.abs(A - (T - (scanner.nextInt() * 0.006))));
        }

        System.out.println(map.entrySet().stream().sorted(Map.Entry.comparingByValue()).findFirst().get().getKey());
    }
}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz