#include <bits/stdc++.h>
using namespace std;
double ans = 1111111111;
int ap[111111], bp[111111], bt[111111], n, m, a, b, l, r, m1, m2, minap, minbp;
double dist(double ax, double ay, double bx, double by) {
  return sqrt((bx - ax) * (bx - ax) + (by - ay) * (by - ay));
}
double f(int i, int j) {
  return dist(0, 0, a, ap[i]) + dist(a, ap[i], b, bp[j]) + bt[j];
}
int main() {
  scanf("%d%d%d%d", &n, &m, &a, &b);
  for (int i = 0; i < n; i++) scanf("%d", &ap[i]);
  for (int i = 0; i < m; i++) scanf("%d", &bp[i]);
  for (int i = 0; i < m; i++) {
    scanf("%d", &bt[i]);
    l = 0, r = n - 1;
    while (r - l >= 3) {
      m1 = l + (r - l) / 3;
      m2 = r - (r - l) / 3;
      if (f(m1, i) < f(m2, i))
        r = m2;
      else
        l = m1;
    }
    for (int j = l; j <= r; j++) {
      if (f(j, i) < ans) ans = f(j, i), minap = j, minbp = i;
    }
  }
  printf("%d %d", minap + 1, minbp + 1);
  return 0;
}
