Manthan, Codefest 16
A
Ebony and Ivory
Codeforces
1100
原题
←B →
翻译中…

Dante is engaged in a fight with "The Savior". Before he can fight it with his sword, he needs to break its shields. He has two guns, Ebony and Ivory, each of them is able to perform any non-negative number of shots.

翻译中…

For every bullet that hits the shield, Ebony deals $*a*$ units of damage while Ivory deals $*b*$ units of damage. In order to break the shield Dante has to deal exactly $*c*$ units of damage. Find out if this is possible.

翻译中…

Input

翻译中…

The first line of the input contains three integers $*a*$, $*b*$, $*c*$ ($1 ≤ *a*, *b* ≤ 100, 1 ≤ *c* ≤ 10 000$) — the number of units of damage dealt by Ebony gun and Ivory gun, and the total number of damage required to break the shield, respectively.

翻译中…

Output

翻译中…

Print "Yes" (without quotes) if Dante can deal exactly $*c*$ damage to the shield and "No" (without quotes) otherwise.

翻译中…

Note

翻译中…

In the second sample, Dante can fire $1$ bullet from Ebony and $2$ from Ivory to deal exactly $1·3 + 2·2 = 7$ damage. In the third sample, Dante can fire $1$ bullet from ebony and no bullets from ivory to do $1·6 + 0·11 = 6$ damage.

翻译中…

样例

Input #1
4 6 15
Output #1
No
InputCopy OutputCopy
Input #2
3 2 7
Output #2
Yes
InputCopy OutputCopy
Input #3
6 11 6
Output #3
Yes
InputCopy OutputCopy
题目信息
题号
633A
时间限制
2 s
内存限制
256 MB
标签
暴力
数学
数论

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