#abc088a. [abc088_a]Infinite Coins

[abc088_a]Infinite Coins

Problem Statement

E869120 has AA 11-yen coins and infinitely many 500500-yen coins.
Determine if he can pay exactly NN yen using only these coins.

Constraints

  • NN is an integer between 11 and 1000010000 (inclusive).
  • AA is an integer between 00 and 10001000 (inclusive).

Input

Input is given from Standard Input in the following format:

NN AA

Output

If E869120 can pay exactly NN yen using only his 11-yen and 500500-yen coins, print Yes; otherwise, print No.


Sample Input 1

2018
218

Sample Output 1

Yes

We can pay 20182018 yen with four 500500-yen coins and 1818 11-yen coins, so the answer is Yes.


Sample Input 2

2763
0

Sample Output 2

No

When we have no 11-yen coins, we can only pay a multiple of 500500 yen using only 500500-yen coins. Since 27632763 is not a multiple of 500500, we cannot pay this amount.


Sample Input 3

37
514

Sample Output 3

Yes