#include <bits/stdc++.h>
using namespace std;
const double pi = acos(-1.0);
const double eps = 1e-8;
inline int sign(double x) {
  if (x < -eps) return -1;
  return x > eps;
}
struct Tpoint {
  double x, y;
  int id;
  Tpoint() {}
  Tpoint(double x, double y) : x(x), y(y) {}
  inline double norm() { return sqrt(x * x + y * y); }
  inline void rotate(double ang) {
    double co = cos(ang), si = sin(ang);
    double tx = x, ty = y;
    x = tx * co - ty * si;
    y = tx * si + ty * co;
  }
};
inline Tpoint operator+(const Tpoint &a, const Tpoint &b) {
  return Tpoint(a.x + b.x, a.y + b.y);
}
inline Tpoint operator-(const Tpoint &a, const Tpoint &b) {
  return Tpoint(a.x - b.x, a.y - b.y);
}
inline Tpoint operator*(const Tpoint &a, const double &b) {
  return Tpoint(a.x * b, a.y * b);
}
inline Tpoint operator/(const Tpoint &a, const double &b) {
  return Tpoint(a.x / b, a.y / b);
}
inline double det(const Tpoint &a, const Tpoint &b) {
  return a.x * b.y - a.y * b.x;
}
inline double dot(const Tpoint &a, const Tpoint &b) {
  return a.x * b.x + a.y * b.y;
}
const int maxn = 100005;
Tpoint p[maxn], q[maxn];
int best[maxn], ansi, ansj;
double ans, A[maxn], B[maxn];
inline bool byY(const Tpoint &a, const Tpoint &b) {
  return sign(a.y - b.y) < 0;
}
inline void solve(Tpoint p[], int n, Tpoint q[], int m) {
  int last = 0, lastp = 0;
  for (int i = 1; i < n; ++i) {
    int l = last - 1, r = m;
    while (l + 1 < r) {
      int mid = (l + r) / 2;
      double l1 = (p[i] - q[mid]).norm() + A[i];
      double l2 = (p[lastp] - q[mid]).norm() + A[lastp];
      if (l1 + eps < l2) {
        r = mid;
      } else {
        l = mid;
      }
    }
    if (r != m) {
      for (int j = last; j < r; ++j) {
        best[j] = lastp;
      }
      last = r;
      lastp = i;
    }
  }
  for (int j = last; j < m; ++j) {
    best[j] = lastp;
  }
  for (int i = 0; i < m; ++i) {
    double l = (q[i] - p[best[i]]).norm();
    l += A[p[best[i]].id] + B[q[i].id];
    if (l + eps < ans) {
      ans = l;
      ansi = p[best[i]].id;
      ansj = q[i].id;
    }
  }
}
int main() {
  int n, m, a, b;
  scanf("%d%d%d%d", &n, &m, &a, &b);
  for (int i = 0; i < n; ++i) {
    scanf("%lf", &p[i].y);
    p[i].x = a;
    p[i].id = i;
    A[i] = p[i].norm();
  }
  for (int i = 0; i < m; ++i) {
    scanf("%lf", &q[i].y);
    q[i].x = b;
    q[i].id = i;
  }
  for (int i = 0; i < m; ++i) {
    scanf("%lf", &B[i]);
  }
  sort(p, p + n, byY);
  sort(q, q + m, byY);
  ans = 1e100;
  ansi = ansj = -1;
  solve(p, n, q, m);
  reverse(p, p + n);
  reverse(q, q + m);
  solve(p, n, q, m);
  printf("%d %d\n", ansi + 1, ansj + 1);
  return 0;
}
