import java.util.Scanner;

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

            int bestI = -1;
            double bestDistance = (int) 1e9;
            for (int i = 0; i < N; i++) {
                double t = T - H[i] * 0.006;
                if (Math.abs(t - A) < bestDistance) {
                    bestDistance = Math.abs(t - A);
                    bestI = i;
                }
            }

            System.out.println(bestI + 1);
        }
    }
} import java.util.Scanner; Scanner java.util public class Main {
    public static void main(String args[]) {
        try (Scanner in = new Scanner(System.in)) {
            int N = in.nextInt();
            int T = in.nextInt();
            int A = in.nextInt();
            int[] H = new int[N];
            for (int i = 0; i < N; i++) {
                H[i] = in.nextInt();
            }

            int bestI = -1;
            double bestDistance = (int) 1e9;
            for (int i = 0; i < N; i++) {
                double t = T - H[i] * 0.006;
                if (Math.abs(t - A) < bestDistance) {
                    bestDistance = Math.abs(t - A);
                    bestI = i;
                }
            }

            System.out.println(bestI + 1);
        }
    }
} Main public static void main(String args[]) {
        try (Scanner in = new Scanner(System.in)) {
            int N = in.nextInt();
            int T = in.nextInt();
            int A = in.nextInt();
            int[] H = new int[N];
            for (int i = 0; i < N; i++) {
                H[i] = in.nextInt();
            }

            int bestI = -1;
            double bestDistance = (int) 1e9;
            for (int i = 0; i < N; i++) {
                double t = T - H[i] * 0.006;
                if (Math.abs(t - A) < bestDistance) {
                    bestDistance = Math.abs(t - A);
                    bestI = i;
                }
            }

            System.out.println(bestI + 1);
        }
    } main {
        try (Scanner in = new Scanner(System.in)) {
            int N = in.nextInt();
            int T = in.nextInt();
            int A = in.nextInt();
            int[] H = new int[N];
            for (int i = 0; i < N; i++) {
                H[i] = in.nextInt();
            }

            int bestI = -1;
            double bestDistance = (int) 1e9;
            for (int i = 0; i < N; i++) {
                double t = T - H[i] * 0.006;
                if (Math.abs(t - A) < bestDistance) {
                    bestDistance = Math.abs(t - A);
                    bestI = i;
                }
            }

            System.out.println(bestI + 1);
        }
    } try (Scanner in = new Scanner(System.in)) {
            int N = in.nextInt();
            int T = in.nextInt();
            int A = in.nextInt();
            int[] H = new int[N];
            for (int i = 0; i < N; i++) {
                H[i] = in.nextInt();
            }

            int bestI = -1;
            double bestDistance = (int) 1e9;
            for (int i = 0; i < N; i++) {
                double t = T - H[i] * 0.006;
                if (Math.abs(t - A) < bestDistance) {
                    bestDistance = Math.abs(t - A);
                    bestI = i;
                }
            }

            System.out.println(bestI + 1);
        } {
            int N = in.nextInt();
            int T = in.nextInt();
            int A = in.nextInt();
            int[] H = new int[N];
            for (int i = 0; i < N; i++) {
                H[i] = in.nextInt();
            }

            int bestI = -1;
            double bestDistance = (int) 1e9;
            for (int i = 0; i < N; i++) {
                double t = T - H[i] * 0.006;
                if (Math.abs(t - A) < bestDistance) {
                    bestDistance = Math.abs(t - A);
                    bestI = i;
                }
            }

            System.out.println(bestI + 1);
        } Scanner in = new Scanner(System.in) Scanner in = new Scanner(System.in) new Scanner(System.in) int N = in.nextInt(); N in.nextInt() in.nextInt in int T = in.nextInt(); T in.nextInt() in.nextInt in int A = in.nextInt(); A in.nextInt() in.nextInt in int[] H = new int[N]; H new int[N] N for (int i = 0; i < N; i++) {
                H[i] = in.nextInt();
            } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
                H[i] = in.nextInt();
            } {
                H[i] = in.nextInt();
            } H[i] = in.nextInt() H[i] H i in.nextInt() in.nextInt in int bestI = -1; bestI -1 1 double bestDistance = (int) 1e9; bestDistance (int) 1e9 for (int i = 0; i < N; i++) {
                double t = T - H[i] * 0.006;
                if (Math.abs(t - A) < bestDistance) {
                    bestDistance = Math.abs(t - A);
                    bestI = i;
                }
            } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
                double t = T - H[i] * 0.006;
                if (Math.abs(t - A) < bestDistance) {
                    bestDistance = Math.abs(t - A);
                    bestI = i;
                }
            } {
                double t = T - H[i] * 0.006;
                if (Math.abs(t - A) < bestDistance) {
                    bestDistance = Math.abs(t - A);
                    bestI = i;
                }
            } double t = T - H[i] * 0.006; t T - H[i] * 0.006 T H[i] * 0.006 H[i] H i 0.006 if (Math.abs(t - A) < bestDistance) {
                    bestDistance = Math.abs(t - A);
                    bestI = i;
                } Math.abs(t - A) < bestDistance Math.abs(t - A) Math.abs Math t - A t A bestDistance {
                    bestDistance = Math.abs(t - A);
                    bestI = i;
                } bestDistance = Math.abs(t - A) bestDistance Math.abs(t - A) Math.abs Math t - A t A bestI = i bestI i System.out.println(bestI + 1) System.out.println System.out System System.out bestI + 1 bestI 1 String args[] args public class Main {
    public static void main(String args[]) {
        try (Scanner in = new Scanner(System.in)) {
            int N = in.nextInt();
            int T = in.nextInt();
            int A = in.nextInt();
            int[] H = new int[N];
            for (int i = 0; i < N; i++) {
                H[i] = in.nextInt();
            }

            int bestI = -1;
            double bestDistance = (int) 1e9;
            for (int i = 0; i < N; i++) {
                double t = T - H[i] * 0.006;
                if (Math.abs(t - A) < bestDistance) {
                    bestDistance = Math.abs(t - A);
                    bestI = i;
                }
            }

            System.out.println(bestI + 1);
        }
    }
} public class Main {
    public static void main(String args[]) {
        try (Scanner in = new Scanner(System.in)) {
            int N = in.nextInt();
            int T = in.nextInt();
            int A = in.nextInt();
            int[] H = new int[N];
            for (int i = 0; i < N; i++) {
                H[i] = in.nextInt();
            }

            int bestI = -1;
            double bestDistance = (int) 1e9;
            for (int i = 0; i < N; i++) {
                double t = T - H[i] * 0.006;
                if (Math.abs(t - A) < bestDistance) {
                    bestDistance = Math.abs(t - A);
                    bestI = i;
                }
            }

            System.out.println(bestI + 1);
        }
    }
} Main
import java.util.Scanner;

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

            int bestI = -1;
            double bestDistance = (int) 1e9;
            for (int i = 0; i < N; i++) {
                double t = T - H[i] * 0.006;
                if (Math.abs(t - A) < bestDistance) {
                    bestDistance = Math.abs(t - A);
                    bestI = i;
                }
            }

            System.out.println(bestI + 1);
        }
    }
}
