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 C (Clang 3.8.0) (judge verdict: Wrong Answer)

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
int main(void)
{
int n;
int a;
int i,j=1;
int x=0;
int z=0;
scanf("%d",&n);
scanf("%d",&a);
if(n<a){
	printf("Yes\n");
	z=1;
}
if(a<n){
	do{
		for(i=1;i<a;i++){
			x=i+500*j;
			if(x==n){
				z=1;
				printf("Yes\n");
				break;
				
			}
			
			
		}
		
		j++;
		x=0;
		
		
	}while(!(500*j>=n));
	
}
if(z==0){
	
	printf("No\n");
	
}
	return 0;
}