import java.util.*;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String line = sc.nextLine();
		String[] s_in;
		
		int N = Integer.parseInt(line);
		
		line = sc.nextLine();
		s_in = line.split(" ");
		int T = Integer.parseInt(s_in[0]);
		int A = Integer.parseInt(s_in[1]);
		
		int[] h = new int[N];
		line = sc.nextLine();
		s_in = line.split(" ");
		for(int i=0;i<N;i++) {
			h[i] = Integer.parseInt(s_in[i]);
		}
		
		double[] tempe = new double[N];
		for(int i=0;i<N;i++) {
			tempe[i] = (double)T - h[i]*0.006;
		}
		
		int nearest_h = -1;
		double nearest_dist = 100000;
		for(int i=0;i<N;i++) {
			if(Math.abs(nearest_dist - A) > Math.abs(tempe[i] - A)) {
				nearest_dist = tempe[i];
				nearest_h    = i;
			}
		}
		System.out.println(nearest_h+1);
	}
}

/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