Problem:
Score: 100 points

Problem Statement

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.

Sample Input 1

2018
218

Sample Output 1

Yes

We can pay 2018 yen with four 500-yen coins and 18 1-yen coins, so the answer is Yes.

Sample Input 2

2763
0

Sample Output 2

No

When we have no 1-yen coins, we can only pay a multiple of 500 yen using only 500-yen coins. Since 2763 is not a multiple of 500, we cannot pay this amount.

Sample Input 3

37
514

Sample Output 3

Yes

Solution in Ruby (2.3.3) (judge verdict: Runtime Error)

ary = []
3.times do
	ary << gets.chomp.split.map(&:to_i)
end

a = [0,0,0]
b = [0,0,0]
flag = nil

(ary[0].min+1).times do |n|
	a[0] = n
	b[0] = ary[0][0]-a[0]
	b[1] = ary[0][1]-a[0]
	b[2] = ary[0][2]-a[0]
	a[1] = ary[1][0]-b[0]
	a[2] = ary[2][0]-b[0]

	isCorrect = 0
	3.times do |na|
		3.times do |nb|
			if ary[na][nb] != a[na]+b[nb] then
				isCorrect = nil
			end
		end
	end
	if isCorrect then
		flag = 0
	end
end
print "#{flag ? "Yes" : "No"}\n"