import java.util.*;
public class Main {
    private static long dp[][];
    private static int N;
    private static int A[];
    private static int B[];

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        int T = sc.nextInt() * 1000;
        int A = sc.nextInt() * 1000;
        int H[] = new int[N];
        for(int i=0; i<N; i++) {
            H[i] = sc.nextInt();
        }

        int X[] = new int[N];
        for(int i=0; i<N; i++) {
            X[i] = Math.abs((T - H[i] * 6) - A);
        }

        int res = 0;
        int minval = X[0];
        for(int i=0; i<N; i++) {
            if(minval > X[i]) {
                minval = X[i];
                res = i;
            }
        }
        System.out.println(String.format("%d", res + 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