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());
    }
} import java.util.Map; Map java.util import java.util.Scanner; Scanner java.util import java.util.TreeMap; TreeMap java.util 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());
    }
} 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());
    } main {

        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());
    } Scanner scanner = new Scanner(System.in); scanner new Scanner(System.in) int N = scanner.nextInt(); N scanner.nextInt() scanner.nextInt scanner int T = scanner.nextInt(); T scanner.nextInt() scanner.nextInt scanner double A = (double) scanner.nextInt(); A (double) scanner.nextInt() scanner.nextInt scanner Map<Integer, Double> map = new TreeMap<>(); map new TreeMap<>() for (int i = 0; i < N; i++) {
            map.put(i + 1, Math.abs(A - (T - (scanner.nextInt() * 0.006))));
        } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
            map.put(i + 1, Math.abs(A - (T - (scanner.nextInt() * 0.006))));
        } {
            map.put(i + 1, Math.abs(A - (T - (scanner.nextInt() * 0.006))));
        } map.put(i + 1, Math.abs(A - (T - (scanner.nextInt() * 0.006)))) map.put map i + 1 i 1 Math.abs(A - (T - (scanner.nextInt() * 0.006))) Math.abs Math A - (T - (scanner.nextInt() * 0.006)) A (T - (scanner.nextInt() * 0.006)) T (scanner.nextInt() * 0.006) scanner.nextInt() scanner.nextInt scanner 0.006 System.out.println(map.entrySet().stream().sorted(Map.Entry.comparingByValue()).findFirst().get().getKey()) System.out.println System.out System System.out map.entrySet().stream().sorted(Map.Entry.comparingByValue()).findFirst().get().getKey() map.entrySet().stream().sorted(Map.Entry.comparingByValue()).findFirst().get().getKey map.entrySet().stream().sorted(Map.Entry.comparingByValue()).findFirst().get() map.entrySet().stream().sorted(Map.Entry.comparingByValue()).findFirst().get map.entrySet().stream().sorted(Map.Entry.comparingByValue()).findFirst() map.entrySet().stream().sorted(Map.Entry.comparingByValue()).findFirst map.entrySet().stream().sorted(Map.Entry.comparingByValue()) map.entrySet().stream().sorted map.entrySet().stream() map.entrySet().stream map.entrySet() map.entrySet map Map.Entry.comparingByValue() Map.Entry.comparingByValue Map.Entry Map Map.Entry String[] args args 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());
    }
} 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());
    }
} Main
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());
    }
}