跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F1586. Arrays

  • ID: 1592
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:入门
  • 上传者:
  • 排序
  • 编程与模拟
  • 入门
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

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


题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 1108 题。保留原作者与原赛事署名。