Problem: 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.

Examples

Input

4 6 15


Output

No


Input

3 2 7


Output

Yes


Input

6 11 6


Output

Yes

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. 

Solution (in PYTHON3):

Solution:
# http://codeforces.com/contest/633/problem/A

"""
Has two guns and which deal damage a and b respectively. In order to break the shield
need to deal exactly c units of damage. Find out if this is possible.

This boils down to whether or not ax+by=c has positive solutions.
"""

from math import ceil


def ExtendedEuclidean(a, b):
    if a == 0:
        return b, 0, 1

    gcd, x_1, y_1 = ExtendedEuclidean(b % a, a)

    x = y_1 - (b // a) * x_1
    y = x_1

    return gcd, x, y


def is_plc(a, b, c):
    # Positive Linear Combination
    gcd, x_0, y_0 = ExtendedEuclidean(a, b)
    if c % gcd != 0:
        return False

    x_0, y_0 = x_0 * (c//gcd), y_0 * (c//gcd)

    if x_0 >= 0 and y_0 >= 0:
        return True
    if x_0 < 0 and y_0 < 0:
        return False
    if x_0 < 0:
        k = ceil(-x_0 * gcd / b)
        x_1, y_1 = x_0 + k * b / gcd, y_0 - k * a / gcd
    elif y_0 < 0:
        k = ceil(-y_0 * gcd / a)
        x_1, y_1 = x_0 - k * b / gcd, y_0 + k * a / gcd

    if x_1 >= 0 and y_1 >= 0:
        return True
    else:
        return False


if __name__ == '__main__':
    a, b, c = map(int, input().split())
    if is_plc(a, b, c):
        print('Yes')
    else:
        print('No')