You have decided to enter your alpaca into the annual Alpaca Racing Tournament! The race will be run around a track of length , and you will be competing against other alpacas. However, your alpaca is running slower than usual because it
ate too many Cheetos got injured while training for the race. Desperate to win, you hack into the tournament software containing the speeds of all alpacas to see if there is a chance of victory. The speed of the alpaca is defined as , and your alpaca has speed . Soon, you realize that you have no chance of winning, but you have one more trick up your sleeve. You create a device that can reduce the speed of any alpaca, setting its new speed to . However, due to a bug in the device, it can only be used times. Your task is to find out if you can win if you use the device at most times. Note that winning means that you finish in the fastest time, meaning no ties.
For all subtasks:
Subtask 1 [10%]
Subtask 2 [90%]
No additional constraints.
The first line of input will contain 4 integers , all separated by a space.
The next lines will each contain , denoting the speed of the alpaca.
The final line of input will contain , denoting the speed of your alpaca.
You are to output
YES if you can win the race outright after using the device at most times and
Note: For this problem, you will NOT be required to pass the sample cases in order to receive points. In addition, you must pass all previous subtasks to earn points for a specific subtask.
Sample Input 1
2 12 3 30 100 50 50
Sample Output 1
Explanation for Sample Output 1
The first alpaca finishes in hours, the second one finishes in hours and you finish in hours.
You use the device on the first alpaca twice, bringing his speed down to , then . The first alpaca now finishes in hours, which is slower than you. You also need to use the device once on the second alpaca. Using the device times allows you to win.
Sample Input 2
4 200 1 1 1000 12 2134 22 1
Sample Output 2