#include <bits/stdc++.h>
using namespace std;
const int MAXN = 8;
const int MAXR = 1;
const int MAXC = 1;
const int MAXBITS = 64;
const int INF = (int)1e9;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, 1, 0, -1};
int dx8[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int dy8[] = {-1, 0, 1, -1, 1, -1, 0, 1};
priority_queue<int, vector<int>, greater<int>> q1;
priority_queue<int, vector<int>, less<int>> q2;
void l() { ; }
int arr[MAXN];
void printMultiSet(multiset<int> m) {
  l();
  for (auto it : m) {
    cout << it << " ";
  }
}
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  int n, m, k, x;
  cin >> n >> m >> k;
  multiset<int> s1, s2;
  for (int i = 0; i < n; ++i) {
    cin >> x;
    s1.insert(x);
  }
  for (int i = 0; i < m; ++i) {
    cin >> x;
    auto it = s1.find(x);
    if (it != s1.end()) {
      s1.erase(it);
    } else {
      s2.insert(x);
    }
  }
  if (s1.size() == 0) {
    cout << "NO";
    return 0;
  }
  vector<int> v1((s1).begin(), (s1).end());
  vector<int> v2((s2).begin(), (s2).end());
  ;
  ;
  int v1n = v1.size();
  int v2n = v2.size();
  int i = 0;
  int j = 0;
  while (i < v1n && j < v2n) {
    if (v1[i] > v2[j]) {
      j++;
    } else {
      i++;
      j++;
    }
  }
  if (i == v1n) {
    cout << "NO";
    return 0;
  }
  if (j == v2n) {
    cout << "YES";
  }
  return 0;
}
