#include <bits/stdc++.h>
using namespace std;
int main() {
  long int n, m, l, r;
  double a, b;
  scanf("%d %d %lf %lf", &n, &m, &a, &b);
  double y, len, Ay[100000], By[100000], minv = 0;
  for (int i = 0; i < n; i++) scanf("%lf", &Ay[i]);
  for (int i = 0; i < m; i++) scanf("%lf", &By[i]);
  for (int i = 0; i < m; i++) {
    scanf("%lf", &len);
    y = By[i] * (a / b);
    int li = 0, ri = n - 1, sred, s = -1;
    while (li + 1 != ri && li != ri) {
      sred = li + (ri - li) / 2;
      (Ay[sred] > y) ? ri = sred : li = sred;
    }
    (abs(Ay[li] - y) > abs(Ay[ri] - y)) ? s = ri : s = li;
    len += (sqrt(Ay[s] * Ay[s] + a * a) +
            sqrt((Ay[s] - By[i]) * (Ay[s] - By[i]) + (b - a) * (b - a)));
    if (len < minv || !minv) {
      minv = len;
      l = s + 1;
      r = i + 1;
    }
  }
  printf("%d %d", l, r);
  return 0;
}
