PROGRAMMING:Save 007
In the old movie "live and let die", there is a plot in which 007 is caught by a drug dealer on an island in the center of an alligator pool. He uses a very bold way to escape - he jumps ashore directly on a series of alligator brain bags in the pool( It is said that the stand in actor was bitten by the last crocodile. Fortunately, he escaped by wearing extra thick boots.)
Let the crocodile pool be a square with 100 meters in length and width, with the center coordinates of (0,0) and the northeast corner coordinates of (50,50). Chixin island is a 15 meter circle with (0,0) as its center. Given the coordinates of the crocodiles distributed in the pool and the maximum distance 007 can jump at a time, you need to tell them whether it is possible for them to escape.
###Input format:
First of all, the first line gives two positive integers: the number of crocodiles $$n $$($$Le 100 $$) and the maximum distance 007 can jump $$d $. Next, there are $$n $$lines, each of which gives the $$(x, y) $$coordinates of an alligator. Note: there won't be two crocodiles at the same point.
###Output format:
If 007 is likely to escape, output "yes" in one line, otherwise output "no".
###Input sample 1:
```in
14 20
25 -15
-25 28
8 49
29 15
-35 -2
5 28
27 -29
-8 -28
-20 -35
-25 -20
-13 29
-30 15
-35 40
12 12
```
###Output sample 1:
```out
Yes
```
###Input example 2:
```in
4 13
-12 12
12 12
-12 -12
12 -12
```
###Output example 2:
```out
No
```
answer:If there is no answer, please comment
Let the crocodile pool be a square with 100 meters in length and width, with the center coordinates of (0,0) and the northeast corner coordinates of (50,50). Chixin island is a 15 meter circle with (0,0) as its center. Given the coordinates of the crocodiles distributed in the pool and the maximum distance 007 can jump at a time, you need to tell them whether it is possible for them to escape.
###Input format:
First of all, the first line gives two positive integers: the number of crocodiles $$n $$($$Le 100 $$) and the maximum distance 007 can jump $$d $. Next, there are $$n $$lines, each of which gives the $$(x, y) $$coordinates of an alligator. Note: there won't be two crocodiles at the same point.
###Output format:
If 007 is likely to escape, output "yes" in one line, otherwise output "no".
###Input sample 1:
```in
14 20
25 -15
-25 28
8 49
29 15
-35 -2
5 28
27 -29
-8 -28
-20 -35
-25 -20
-13 29
-30 15
-35 40
12 12
```
###Output sample 1:
```out
Yes
```
###Input example 2:
```in
4 13
-12 12
12 12
-12 -12
12 -12
```
###Output example 2:
```out
No
```
answer:If there is no answer, please comment