import java.io.PrintWriter; 
import java.util.Scanner; 

public class Main
{
	static Scanner in; 
	static PrintWriter out; 

	static void solve()
	{
		Scanner stdIn = new Scanner(System.in);
		int N = stdIn.nextInt();
		int T = stdIn.nextInt();
		int A = stdIn.nextInt();
		int[] H = new int[N];
		for(int i = 0; i < N; i++)
		{
			H[i] = stdIn.nextInt();
		}
		int answer = 1;
		double near_A = Math.abs(A - (T - (H[0] * 0.006)));
		for(int i = 1; i < N; i++)
		{
			if(near_A > Math.abs(A - (T - (H[i] * 0.006))))
			{
				answer = i + 1;
				near_A = Math.abs(A - (T - (H[i] * 0.006)));
			}
		}
		System.out.println(answer);
	}

	public static void main(String[] args) 
	{ 
		in = new Scanner(System.in); 
		out = new PrintWriter(System.out); 
		solve(); 
		out.flush(); 
		out.close(); 
		in.close(); 
	} 
}
/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