E869120 has A 1-yen coins and infinitely many 500-yen coins.
Determine if he can pay exactly N yen using only these coins.

Constraints

• N is an integer between 1 and 10000 (inclusive).
• A is an integer between 0 and 1000 (inclusive).

Input

Input is given from Standard Input in the following format:

N
A

Output

If E869120 can pay exactly N yen using only his 1-yen and 500-yen coins, print Yes; otherwise, print No.

Examples

Input

2018
218

Output

Yes

Input

2763
0

Output

No

Input

37
514

Output

Yes

见题面

见题面