import java.util.*;
public class Main{
  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() * 6;
    }
    int[] abs = new int[n];
    int minpoint = -1;
    int min = 2000000000;
    for(int i = 0;i<n;i++){
      abs[i] =t-h[i]-a;
      if(abs[i]<0)abs[i]*=-1;
      if(min > abs[i]){
        min = abs[i];
        minpoint = i;
      }
    }
    System.out.println(minpoint+1);
  }
} import java.util.*; util.* java public class Main{
  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() * 6;
    }
    int[] abs = new int[n];
    int minpoint = -1;
    int min = 2000000000;
    for(int i = 0;i<n;i++){
      abs[i] =t-h[i]-a;
      if(abs[i]<0)abs[i]*=-1;
      if(min > abs[i]){
        min = abs[i];
        minpoint = i;
      }
    }
    System.out.println(minpoint+1);
  }
} Main 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() * 6;
    }
    int[] abs = new int[n];
    int minpoint = -1;
    int min = 2000000000;
    for(int i = 0;i<n;i++){
      abs[i] =t-h[i]-a;
      if(abs[i]<0)abs[i]*=-1;
      if(min > abs[i]){
        min = abs[i];
        minpoint = i;
      }
    }
    System.out.println(minpoint+1);
  } main {
    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() * 6;
    }
    int[] abs = new int[n];
    int minpoint = -1;
    int min = 2000000000;
    for(int i = 0;i<n;i++){
      abs[i] =t-h[i]-a;
      if(abs[i]<0)abs[i]*=-1;
      if(min > abs[i]){
        min = abs[i];
        minpoint = i;
      }
    }
    System.out.println(minpoint+1);
  } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int n = sc.nextInt(); n sc.nextInt() sc.nextInt sc int t = sc.nextInt() * 1000; t sc.nextInt() * 1000 sc.nextInt() sc.nextInt sc 1000 int a = sc.nextInt() * 1000; a sc.nextInt() * 1000 sc.nextInt() sc.nextInt sc 1000 int[] h = new int[n]; h new int[n] n for(int i = 0;i<n;i++){
      h[i] = sc.nextInt() * 6;
    } int i = 0; int i = 0; i 0 i<n i n i++ i++ i {
      h[i] = sc.nextInt() * 6;
    } {
      h[i] = sc.nextInt() * 6;
    } h[i] = sc.nextInt() * 6 h[i] h i sc.nextInt() * 6 sc.nextInt() sc.nextInt sc 6 int[] abs = new int[n]; abs new int[n] n int minpoint = -1; minpoint -1 1 int min = 2000000000; min 2000000000 for(int i = 0;i<n;i++){
      abs[i] =t-h[i]-a;
      if(abs[i]<0)abs[i]*=-1;
      if(min > abs[i]){
        min = abs[i];
        minpoint = i;
      }
    } int i = 0; int i = 0; i 0 i<n i n i++ i++ i {
      abs[i] =t-h[i]-a;
      if(abs[i]<0)abs[i]*=-1;
      if(min > abs[i]){
        min = abs[i];
        minpoint = i;
      }
    } {
      abs[i] =t-h[i]-a;
      if(abs[i]<0)abs[i]*=-1;
      if(min > abs[i]){
        min = abs[i];
        minpoint = i;
      }
    } abs[i] =t-h[i]-a abs[i] abs i t-h[i]-a t-h[i]-a t h[i] h i a if(abs[i]<0)abs[i]*=-1; abs[i]<0 abs[i] abs i 0 abs[i]*=-1 abs[i] abs i -1 1 if(min > abs[i]){
        min = abs[i];
        minpoint = i;
      } min > abs[i] min abs[i] abs i {
        min = abs[i];
        minpoint = i;
      } min = abs[i] min abs[i] abs i minpoint = i minpoint i System.out.println(minpoint+1) System.out.println System.out System System.out minpoint+1 minpoint 1 String[] args args public class Main{
  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() * 6;
    }
    int[] abs = new int[n];
    int minpoint = -1;
    int min = 2000000000;
    for(int i = 0;i<n;i++){
      abs[i] =t-h[i]-a;
      if(abs[i]<0)abs[i]*=-1;
      if(min > abs[i]){
        min = abs[i];
        minpoint = i;
      }
    }
    System.out.println(minpoint+1);
  }
} public class Main{
  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() * 6;
    }
    int[] abs = new int[n];
    int minpoint = -1;
    int min = 2000000000;
    for(int i = 0;i<n;i++){
      abs[i] =t-h[i]-a;
      if(abs[i]<0)abs[i]*=-1;
      if(min > abs[i]){
        min = abs[i];
        minpoint = i;
      }
    }
    System.out.println(minpoint+1);
  }
} Main
import java.util.*;
public class Main{
  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() * 6;
    }
    int[] abs = new int[n];
    int minpoint = -1;
    int min = 2000000000;
    for(int i = 0;i<n;i++){
      abs[i] =t-h[i]-a;
      if(abs[i]<0)abs[i]*=-1;
      if(min > abs[i]){
        min = abs[i];
        minpoint = i;
      }
    }
    System.out.println(minpoint+1);
  }
}
