#include <bits/stdc++.h>
using namespace std;
double PI = acos(-1);
inline string IntToString(int a) {
  char x[100];
  sprintf(x, "%d", a);
  string s = x;
  return s;
}
inline int StringToInt(string a) {
  char x[100];
  int res;
  strcpy(x, a.c_str());
  sscanf(x, "%d", &res);
  return res;
}
inline string GetString(void) {
  char x[1000005];
  scanf("%s", x);
  string s = x;
  return s;
}
int gcd(int a, int b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
int lcm(int a, int b) { return (a * (b / gcd(a, b))); }
bitset<10000010> bs;
vector<int> primes;
void sieve(long long upperbound) {
  bs.set();
  bs[0] = bs[1] = 0;
  primes.push_back(0);
  for (long long i = 2; i <= upperbound + 1; i++)
    if (bs[i]) {
      for (long long j = i * i; j <= upperbound + 1; j += i) bs[j] = 0;
      primes.push_back((int)i);
    }
}
int main() {
  int nA, nB;
  scanf("%d %d", &nA, &nB);
  int k, m;
  scanf("%d %d", &k, &m);
  vector<int> dataA;
  vector<int> dataB;
  int temp;
  for (int(a) = 0; (a) < (int)(nA); (a)++) {
    scanf("%d", &temp);
    dataA.push_back(temp);
  }
  for (int(b) = 0; (b) < (int)(nB); (b)++) {
    scanf("%d", &temp);
    dataB.push_back(temp);
  }
  sort(dataA.begin(), dataA.end());
  sort(dataB.begin(), dataB.end());
  if (dataA[(k - 1)] < dataB[(nB - m)])
    printf("YES\n");
  else
    printf("NO\n");
  return 0;
}
