Chocolate Bar

Time limit2sMemory limit1024 MB

Summary

Given N coins of 100 won each, the task is to check whether the total value is at least the price M and print Yes or No.

Level: Easy1 of 10
Topics: Math, Implementation
Solved: No attempts yet

Problem

Bamgo has $N$ coins worth 100 won each and wants to use them to buy a chocolate bar priced at $M$ won. Bamgo wants to know whether the money on hand can buy the chocolate bar. If the money Bamgo has is at least the price of the chocolate bar, Bamgo can buy it. Determine whether the money is enough.

Input

The first line contains two integers $N$ and $M$ , separated by a space. ( $1 \le N \le 100$ , $1 \le M \le 10\ 000$ )

Output

If Bamgo can buy the chocolate bar, print Yes. Otherwise, print No.

Examples3

Example 1
Input
```
30 300
```
Expected output
```
Yes
```
Example 2
Input
```
5 10000
```
Expected output
```
No
```
Example 3
Input
```
7 785
```
Expected output
```
No
```