#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 7;
long long n, vb, vs;
long long a[maxn];
long long x, y;
struct node {
  int pos;
  double dis;
  double t;
} z[maxn];
bool cmp(node l, node r) {
  if (l.t != r.t) return l.t < r.t;
  return l.dis < r.dis;
}
int main(void) {
  scanf("%lld %lld %lld", &n, &vb, &vs);
  for (int i = 1; i <= n; i++) scanf("%lld", &a[i]);
  scanf("%lld %lld", &x, &y);
  for (int i = 1; i <= n; i++) {
    double d = sqrt((x - a[i]) * (x - a[i]) + (y) * (y));
    z[i].t = d / vs + (a[i] * 1.0) / vb;
    z[i].dis = d;
    z[i].pos = i;
  }
  sort(z + 2, z + 1 + n, cmp);
  cout << z[2].pos << endl;
  return 0;
}
