Problem hidden
This problem was hidden by Editorial Board member probably because it has incorrect language version or invalid test data, or description of the problem is not clear.

Problem hidden

CHUOIVOHAN - Infinity sequence

Vasya likes everything infinite. Now he is studying the properties of a sequence s, such that its first element is equal to a (s1=a), and the difference between any two neighbouring elements is equal to c (si-si-1=c). In particular, Vasya wonders if his favourite integer b appears in this sequence, that is, there exists a positive integer i, such that si=b. Of course, you are the person he asks for a help. 


The first line of the input contain three integers a, b and c (-10≤ a,b,c ≤109), the first element of the sequence, Vasya's favorite number and the difference between any two neighbouring elements of the sequence, respectively. 


If b appears in the sequence s print "YES" (without quotes), otherwise print "NO" (without quotes). 


1 7 3


Added by:Tai Do
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: GOSU