#include <bits/stdc++.h>
using namespace std;
double a, b;
double distan(double x, double y, double l) {
  return sqrt(a * a + x * x) + sqrt((b - a) * (b - a) + (y - x) * (y - x)) + l;
}
int main() {
  int i, j, k, l, m, n, t;
  double left[100005];
  double right[100005];
  double rightval[100005];
  double dist, locdist, locdist1;
  scanf("%d%d", &n, &m);
  scanf("%lf%lf", &a, &b);
  for (int i = (0); i < (n); i++) scanf("%lf", &left[i]);
  for (int i = (0); i < (m); i++) scanf("%lf", &right[i]);
  for (int i = (0); i < (m); i++) scanf("%lf", &rightval[i]);
  dist = 1000000000;
  j = 0;
  for (int i = (0); i < (m); i++) {
    while (j < n - 1 && distan(left[j], right[i], rightval[i]) >
                            distan(left[j + 1], right[i], rightval[i]))
      j++;
    if (dist > distan(left[j], right[i], rightval[i])) {
      dist = distan(left[j], right[i], rightval[i]);
      k = j;
      l = i;
    }
  }
  printf("%d %d", k + 1, l + 1);
}
