#include <bits/stdc++.h>
const int max_n = 1e5 + 15;
int n, m, a, b, idl, idr, ya[max_n], yb[max_n];
double temp, mini = 1e10;
inline double f(int i, int j) {
  return hypot(a, ya[i]) + hypot(a - b, ya[i] - yb[j]);
}
int main() {
  scanf("%d %d %d %d", &n, &m, &a, &b);
  for (int i = 0; i < n; i++) scanf("%d", ya + i);
  for (int i = 0; i < m; i++) scanf("%d", yb + i);
  for (int i = 0, j = 0; j < m; j++) {
    scanf("%lf", &temp);
    while (i + 1 < n && f(i + 1, j) < f(i, j)) i++;
    if (temp + f(i, j) < mini) mini = temp + f(idl = i, idr = j);
  }
  printf("%d %d", idl + 1, idr + 1);
  return 0;
}
