Scout YYF II

Time Limit: 1000MS

Memory Limit: 65536K

Description

After the dangerous "mine road", YYF has finally enter the enemy's base, which is a round glass building. However, this is totally a trap! There are no enemy in the base but bombs instead. Some time after YYF enter the base, the enemy's detectors find him and ignite the bomb system to kill him. As a professional scout, YYF feels the bomb and choose a best direction to run. When a bomb explodes, it will destroy a circle area including the boundary which becomes larger and larger. YYF runs very fast in the same speed as the radius of bomb area grows. If he can run out of the base before the explosions destroy him, he will be safe after that. Now you are given the YYF's and bombs' initial places, please calculate that if our couragous scout can possibly save himself.

Input

The input contains many test cases ended with EOF. The first line of each test case is N (1 ≤ N ≤ 10) and R (1 ≤ R ≤ 1000), standing for the number of bombs and the radius of the base. The center of the base is always at (0,0). The second line of each test case is two real numbers standing for the initial place of YYF. In the next N lines, each contains two real numbers standing for the initial place of a bomb. It is guaranteed that all the initial places is in the base.

Output

For each test case, if YYF can escape safely, output "Yes" in a single line, otherwise "No" instead.

Sample Input

2 10
0 0
1 0
-1 0
4 10
0 0
1 0
-1 0
0 1
0 -1

Sample Output

Yes
No

Hint

Source

POJ Monthly Contest - 2009.08.23, Simon

提交代码