Jumping Jack

View as PDF

Submit solution

Points: 100
Time limit: 1.0s
Memory limit: 977M

Author:
Problem type

Jack can jump in two different ways. He can jump 1 step forward and l steps left, or he can jump 1 step forward and r steps right. He wants to end up m steps directly infront of where he started. Is this possible?

Input

The first line contains three integers, l, r and m.

Output

Output a line containing Yes or No, stating whether it is possible for Jack to end up exactly m steps forward.

Constraints

  • 1 \le l,r,m \le 1000

Example 1

Input
2 3 5
Output
Yes

Example 2

Input
2 3 6
Output
No

Comments

There are no comments at the moment.