#include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
  long long int n, m, a, b;
  scanf("%lld %lld %lld %lld", &n, &m, &a, &b);
  vector<int> aa(n), bb(m), ll(m);
  for (int i = 0; i < n; ++i) {
    scanf("%d", &aa[i]);
  }
  for (int i = 0; i < m; ++i) {
    scanf("%d", &bb[i]);
  }
  for (int i = 0; i < m; ++i) {
    scanf("%d", &ll[i]);
  }
  int x, y;
  double ans = 1000000000000000000;
  for (int i = 0; i < m; ++i) {
    float pt = a * bb[i] * 1.0 / b;
    int pt1 = lower_bound(aa.begin(), aa.end(), pt) - aa.begin();
    double a1 = sqrt(aa[pt1] * 1LL * aa[pt1] + a * 1LL * a) +
                sqrt((b - a) * 1LL * (b - a) +
                     (aa[pt1] - bb[i]) * 1LL * (aa[pt1] - bb[i])) +
                ll[i];
    if (ans > a1) {
      ans = a1;
      x = i;
      y = pt1;
    }
    pt1--;
    a1 = sqrt(aa[pt1] * 1LL * aa[pt1] + a * 1LL * a) +
         sqrt((b - a) * 1LL * (b - a) +
              (aa[pt1] - bb[i]) * 1LL * (aa[pt1] - bb[i])) +
         ll[i];
    if (pt1 >= 0)
      if (ans > a1) {
        ans = a1;
        x = i;
        y = pt1;
      }
  }
  printf("%d %d\n", y + 1, x + 1);
  return 0;
}
