测评会员优惠活动进行中 · 开通 VIP,有效期内测评不限次 VIP 优惠中 · 测评不限次 立即查看

A11474. Cloning Toys

编程题 普及/提高-

题目描述

Imp likes his plush toy a lot.

![](/uploads/acgo/image/e9de0e664c38e7e9_e142e6572dfe.jpeg)Recently, he found a machine that can clone plush toys. Imp knows that if he applies the machine to an original toy, he additionally gets one more original toy and one copy, and if he applies the machine to a copied toy, he gets two additional copies.

Initially, Imp has only one original toy. He wants to know if it is possible to use machine to get exactly $x$ copied toys and $y$ original toys? He can't throw toys away, and he can't apply the machine to a copy if he doesn't currently have any copies.

输入格式

The only line contains two integers $x$ and $y$ ( $0<=x,y<=10^{9}$ ) — the number of copies and the number of original toys Imp wants to get (including the initial one).

输出格式

Print "Yes", if the desired configuration is possible, and "No" otherwise.

You can print each letter in arbitrary case (upper or lower).

输入输出样例

输入 #1
6 3
输出 #1
Yes
输入 #2
4 2
输出 #2
No
输入 #3
1000 1001
输出 #3
Yes

说明/提示

In the first example, Imp has to apply the machine twice to original toys and then twice to copies.
上一题 去做题 下一题