#include <iostream>
#include <algorithm>
using namespace std;

int n, m, hmin, hmax;
int h[1001], s[1001];
bool f[1001];

bool cmp(int a, int b) {
    return a > b;
}


int main() {
    cin >> n >> m >> hmin >> hmax;
    for (int i = 1; i <= n; ++i) cin >> h[i];
    for (int i = 1; i <= m; ++i) cin >> s[i];
    sort(s + 1, s + m + 1);
    sort(h + 1, h + n + 1, cmp);

    for (int i = 1; i <= n; ++i) {
        if (h[i] > hmax) {
            cout << "No";
            return 0;
        }

        if (h[i] < hmin) {
            bool ok = false;
            for (int j = 1; j <= m; ++j) {
                if (!f[j] && h[i] + s[j] >= hmin && h[i] + s[j] <= hmax) {
                    f[j] = true;
                    ok = true;
                    break;
                }
            }

            if (!ok) {
                cout << "No";
                return 0;
            }
        }
    }

    cout << "Yes";

    return 0;
}