codeforces #317 div2 A. Arrays (水)

A. Arrays

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given two arrays A and B consisting of integers, sorted in non-decreasing order. Check whether it is possible to choose knumbers 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 Awas strictly less than any number chosen in array B. Otherwise, print "NO" (without the quotes).

Sample test(s)

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: .

 应该３分钟过的题。。。

结果花了８分钟。。。ssssad

/*************************************************************************
    > File Name: code/cf/#317/A.cpp
    > Author: 111qqz
    > Email: rkz2013@126.com 
    > Created Time: 2015年08月23日 星期日 00时29分47秒
 ************************************************************************/

#include<iostream>
#include<iomanip>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<string>
#include<map>
#include<set>
#include<queue>
#include<vector>
#include<stack>
#include<cctype>
#define y1 hust111qqz
#define yn hez111qqz
#define j1 cute111qqz
#define ms(a,x) memset(a,x,sizeof(a))
#define lr dying111qqz
using namespace std;
#define For(i, n) for (int i=0;i<int(n);++i)  
typedef long long LL;
typedef double DB;
const int inf = 0x3f3f3f3f;
const int N=1E5+7;
int na,nb,k,m;
int a[N],b[N];
int main()
{
  #ifndef  ONLINE_JUDGE 
    freopen("in.txt","r",stdin); 
  #endif
    cin>>na>>nb;
    cin>>k>>m;
    for ( int i = 1 ; i <= na ; i++){
    scanf("%d",&a[i]);
    }
    for ( int i  = 1 ; i<= nb ; i++){
    scanf("%d",&b[i]);
    }
    if (a[k]<b[nb-m+1]){
    puts("YES");
    }
    else
    {
    puts("NO");
    }
  
  
 #ifndef ONLINE_JUDGE  
  fclose(stdin);
  #endif
    return 0;
}