#include <bits/stdc++.h>
int readint() {
  int flag = 0;
  char c = getchar();
  if (c == '-') flag = 1;
  while (c < '0' || c > '9') c = getchar();
  int ret = 0;
  while (c >= '0' && c <= '9') {
    ret = 10 * ret + c - 48;
    c = getchar();
  }
  if (flag == 0) return ret;
  return -ret;
}
long long int readll() {
  char c = getchar();
  while (c < '0' || c > '9') c = getchar();
  long long int ret = 0;
  while (c >= '0' && c <= '9') {
    ret = 10 * ret + c - 48;
    c = getchar();
  }
  return ret;
}
int a[10000000];
int b[10000000];
int main() {
  int na = readint();
  int nb = readint();
  int k = readint();
  int m = readint();
  int max = -1000000004, c1 = 0, c2 = 0;
  for (int i = 0; i < na; i++) a[i] = readint();
  for (int i = 0; i < nb; i++) b[i] = readint();
  for (int i = 0; i < na; i++) {
    c1++;
    max = a[i];
    if (c1 == k) break;
  }
  for (int i = 0; i < nb; i++) {
    if (b[i] > max) c2++;
  }
  if (c2 >= m)
    printf("YES\n");
  else
    printf("NO\n");
  return 0;
}

### Prompt

Please create a solution in CPP to the following problem:

You are given two arrays A and B consisting of integers, sorted in non-decreasing order. Check whether it is possible to choose k numbers in array A and choose m numbers in array B so that any number chosen in the first array is strictly less than any number chosen in the second array.

Input

The first line contains two integers nA, nB (1 ≤ nA, nB ≤ 105), separated by a space — the sizes of arrays A and B, correspondingly.

The second line contains two integers k and m (1 ≤ k ≤ nA, 1 ≤ m ≤ nB), separated by a space.

The third line contains nA numbers a1, a2, ... anA ( - 109 ≤ a1 ≤ a2 ≤ ... ≤ anA ≤ 109), separated by spaces — elements of array A.

The fourth line contains nB integers b1, b2, ... bnB ( - 109 ≤ b1 ≤ b2 ≤ ... ≤ bnB ≤ 109), separated by spaces — elements of array B.

Output

Print "YES" (without the quotes), if you can choose k numbers in array A and m numbers in array B so that any number chosen in array A was strictly less than any number chosen in array B. Otherwise, print "NO" (without the quotes).

Examples

Input

3 3
2 1
1 2 3
3 4 5


Output

YES


Input

3 3
3 3
1 2 3
3 4 5


Output

NO


Input

5 2
3 1
1 1 1 1 1
2 2


Output

YES

Note

In the first sample test you can, for example, choose numbers 1 and 2 from array A and number 3 from array B (1 < 3 and 2 < 3).

In the second sample test the only way to choose k elements in the first array and m elements in the second one is to choose all numbers in both arrays, but then not all the numbers chosen in A will be less than all the numbers chosen in B: <image>.

### Response

```cpp
#include <bits/stdc++.h>
int readint() {
  int flag = 0;
  char c = getchar();
  if (c == '-') flag = 1;
  while (c < '0' || c > '9') c = getchar();
  int ret = 0;
  while (c >= '0' && c <= '9') {
    ret = 10 * ret + c - 48;
    c = getchar();
  }
  if (flag == 0) return ret;
  return -ret;
}
long long int readll() {
  char c = getchar();
  while (c < '0' || c > '9') c = getchar();
  long long int ret = 0;
  while (c >= '0' && c <= '9') {
    ret = 10 * ret + c - 48;
    c = getchar();
  }
  return ret;
}
int a[10000000];
int b[10000000];
int main() {
  int na = readint();
  int nb = readint();
  int k = readint();
  int m = readint();
  int max = -1000000004, c1 = 0, c2 = 0;
  for (int i = 0; i < na; i++) a[i] = readint();
  for (int i = 0; i < nb; i++) b[i] = readint();
  for (int i = 0; i < na; i++) {
    c1++;
    max = a[i];
    if (c1 == k) break;
  }
  for (int i = 0; i < nb; i++) {
    if (b[i] > max) c2++;
  }
  if (c2 >= m)
    printf("YES\n");
  else
    printf("NO\n");
  return 0;
}

```