#include <bits/stdc++.h>
using namespace std;
const long double MIN = 1e-8;
const int MAXN = 100000 + 1000;
int A[MAXN];
int B[MAXN];
int l[MAXN];
int n, m, a, b;
int ma[MAXN];
long double fas(int x, int y) {
  complex<long double> p = complex<long double>(a, A[x]);
  complex<long double> q = complex<long double>(b, B[y]);
  return abs(p) + abs(q - p) + l[y];
}
int main() {
  scanf(" %d %d %d %d", &n, &m, &a, &b);
  for (int i = 1; i <= n; i++) scanf(" %d", &A[i]);
  for (int i = 1; i <= m; i++) scanf(" %d", &B[i]);
  for (int i = 1; i <= m; i++) scanf(" %d", &l[i]);
  A[0] = -100000000;
  int sum = 0;
  for (int i = 1; i <= m; i++) {
    while (sum < n && fas(sum, i) - MIN > fas(sum + 1, i)) sum++;
    ma[i] = sum;
  }
  int z = 1;
  for (int i = 2; i <= m; i++)
    if (fas(ma[i], i) < fas(ma[z], z) - MIN) z = i;
  cout << ma[z] << " " << z << endl;
}
