#include <bits/stdc++.h>
using namespace std;
long double a, b, A[200005], B[200005], l[200005];
int main() {
  int first, second, n, m, i, j;
  long double ans = 1e15 + 111;
  cin >> n >> m >> a >> b;
  for (i = 1; i <= n; i++) cin >> A[i];
  for (i = 1; i <= m; i++) cin >> B[i];
  for (i = 1; i <= m; i++) cin >> l[i];
  for (i = 1; i <= m; i++) {
    long double ny = 1.0 * B[i] / b * a;
    long double t = l[i];
    int ps = lower_bound(A + 1, A + n + 1, ny) - A;
    for (j = ps - 1; j <= ps; j++)
      if (j >= 1 && j <= n) {
        long double dis =
            sqrt(1.0 * a * a + 1.0 * A[j] * A[j]) +
            sqrt(1.0 * (a - b) * (a - b) + 1.0 * (A[j] - B[i]) * (A[j] - B[i]));
        if (ans - dis - t > 0.000001) {
          first = i;
          second = j;
          ans = dis + t;
        }
      }
  }
  cout << second << ' ' << first;
  return 0;
}
