#include <bits/stdc++.h>
using namespace std;
int a[110000];
int b[110000];
int ta[110000];
int tb[110000];
int srt[110000];
int numa[210000];
int numb[210000];
int main() {
  int n, m, gg;
  scanf("%d %d %d", &n, &m, &gg);
  int num = 0;
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
    srt[num++] = a[i];
  }
  for (int i = 0; i < m; i++) {
    scanf("%d", &b[i]);
    srt[num++] = b[i];
  }
  sort(srt, srt + num);
  num = unique(srt, srt + num) - srt;
  for (int i = 0; i < n; i++) {
    a[i] = lower_bound(srt, srt + num, a[i]) - srt;
  }
  for (int i = 0; i < m; i++) {
    b[i] = lower_bound(srt, srt + num, b[i]) - srt;
  }
  sort(a, a + n);
  sort(b, b + m);
  int chk = 1;
  int nn = 0, mm = 0;
  for (int i = 0; i < n; i++) {
    int *ptr = lower_bound(b, b + m, a[i]);
    if (ptr == b + m) {
      printf("YES\n");
      return 0;
    }
    ta[nn++] = *ptr;
  }
  for (int i = 0; i < m; i++) {
    int ind = upper_bound(ta, ta + nn, b[i]) - 1 - ta;
    if (ind < 0) continue;
    tb[mm++] = ta[ind];
  }
  n = nn;
  m = mm;
  if (m == 0) {
    printf("YES\n");
    return 0;
  }
  sort(ta, ta + n);
  sort(tb, tb + m);
  gg = ta[n - 1];
  if (tb[m - 1] > gg) gg = tb[m - 1];
  gg++;
  for (int i = 0; i < n; i++) {
    numa[ta[i]]++;
  }
  for (int i = 0; i < m; i++) {
    numb[tb[i]]++;
  }
  for (int i = gg - 1; i >= 0; i--) {
    if (numa[i] > numb[i]) {
      printf("YES\n");
      return 0;
    } else {
      if (i - 1 >= 0) {
        numa[i - 1] += numa[i];
        numb[i - 1] += numb[i];
      }
    }
  }
  printf("NO\n");
}
