#include <bits/stdc++.h>
using namespace std;
double station[105];
double dis(double x1, double y1, double x2, double y2) {
  if (x1 == x2 && y1 == y2) return 0.000;
  return sqrt((x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1));
}
struct stu {
  double time;
  double dis2;
  int num;
} st[105];
bool cmp(stu x, stu y) {
  if (x.time == y.time) return x.dis2 < y.dis2;
  return x.time < y.time;
}
int main() {
  int n;
  double vb, vs;
  double xu, yu;
  memset(station, 0, sizeof(station));
  memset(st, 0, sizeof(st));
  scanf("%d %lf %lf", &n, &vb, &vs);
  for (int i = 0; i < n; i++) {
    scanf("%lf", &station[i]);
  }
  scanf("%lf%lf", &xu, &yu);
  for (int i = 1; i < n; i++) {
    st[i].dis2 = dis(station[i], 0, xu, yu);
    st[i].time = (station[i] - station[0]) / vb + st[i].dis2 / vs;
    st[i].num = i + 1;
  }
  sort(st + 1, st + n, cmp);
  printf("%d\n", st[1].num);
  return 0;
}
