Zenyk's Contest

Limits: 2 sec., 256 MiB

This statement was translated automatically from Ukrainian.

Zenyk wanted to prepare a contest called Zenyk’s Contest on Algotester. He prepared \(n\) problems. Then he decided that this number of problems was not enough, so he chose \(k\) problems out of his \(n\) and divided each of the chosen problems into two.

Administrators told him that each problem in the contest has a corresponding English letter, and therefore there cannot be more than 26 problems in the contest.

You need to tell whether Zenyk will have enough letters for all his problems after the division.

Input

The first line contains two integers \(n\) and \(k\) — the initial number of problems and the number of problems that were divided into two.

Output

Print Yes if Zenyk has enough letters, and No if he does not have enough letters.

Constraints

\(1 \le k \le n \le 26\).

Samples