Codeforces Round 353 (Div. 2)
A
Infinite Sequence
Codeforces
1100
原题
←B →
翻译中…

Vasya likes everything infinite. Now he is studying the properties of a sequence $*s*$, such that its first element is equal to $*a*$ ($*s*_{1} = *a*$), and the difference between any two neighbouring elements is equal to $*c*$ ($*s*_{*i*} - *s*_{*i* - 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 $*s*_{*i*} = *b*$. Of course, you are the person he asks for a help.

翻译中…

Input

翻译中…

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

翻译中…

Output

翻译中…

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

翻译中…

Note

翻译中…

In the first sample, the sequence starts from integers $1$, $4$, $7$, so $7$ is its element.

翻译中…

In the second sample, the favorite integer of Vasya is equal to the first element of the sequence.

翻译中…

In the third sample all elements of the sequence are greater than Vasya's favorite integer.

翻译中…

In the fourth sample, the sequence starts from $0$, $50$, $100$, and all the following elements are greater than Vasya's favorite integer.

翻译中…

样例

Input #1
1 7 3
Output #1
YES
InputCopy OutputCopy
Input #2
10 10 0
Output #2
YES
InputCopy OutputCopy
Input #3
1 -4 5
Output #3
NO
InputCopy OutputCopy
Input #4
0 60 50
Output #4
NO
InputCopy OutputCopy
题目信息
题号
675A
时间限制
1 s
内存限制
256 MB
标签
数学

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。