Problem9407--ABC208 —— A - Rolling Dice

9407: ABC208 —— A - Rolling Dice

[Creator : ]
Time Limit : 1.000 sec  Memory Limit : 512 MiB

Description

Is it possible to get a sum of $B$ when throwing a die with six faces $1,2,\ldots,6$ $A$ times?

Input

Input is given from Standard Input in the following format:

```
$A$ $B$
```

Output

If it is possible to get a sum of $B$, print `Yes`; otherwise, print `No`.

Constraints

-   $1 \leq A \leq 100$
-   $1 \leq B \leq 1000$
-   $A$ and $B$ are integers.

Sample 1 Input

2 11

Sample 1 Output

Yes
There are two ways to get a sum of 11 when throwing a 6-faced die twice:
  • getting 6 in the first throw and 5 in the second throw;
  • getting 5 in the first throw and 6 in the second throw.

Sample 2 Input

2 13

Sample 2 Output

No
There is no way to get a sum of 13 when throwing a 6-faced die twice.

Sample 3 Input

100 600

Sample 3 Output

Yes

Source/Category