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:
import sys,math,io,os,time,itertools,collections
mod=10**9+7
sys.setrecursionlimit(10000)
i=sys.stdin.readline
p=sys.stdout.write
#use sys.stdout.write() (remember to convert to str b4 and concatenate "\n")
global start,end

#binary search
def isin(l,x):
    left=0
    right=len(l)-1
    if x<l[0]:
        return -1
    while left<=right:
        mid=left + (right -left)//2
        if l[mid]==x:
            return mid
        elif l[mid]<x:
            ans=mid
            left=mid+1
        else:
            right=mid-1
    return ans

#is palindrome or not
def ispal(l):
    n=len(l)
    for i in range(n//2+1):
        if l[i]!=l[n-i-1]:
            return False
    return True

#coordinate compression
def ccarray(l):
    d={l[k]:k for k in range(len(l))}
    m=sorted(d)
    return [d[m[k]] for k in range(len(l))]

#checks if prime or not
def is_prime(n):
    if n<=3:
        return n>1
    if n%2==0 or n%3==0:
        return False
    k=5
    while k**2<=n:
        if n%k==0 or n%(k+2)==0:
            return False
        k+=6
    return True

#sieve of eratosthenes
def sieve(n):
    prime=[True for k in range(n+1)]
    p=2
    while p*p<=n:
        if prime[p]==True:
            for k in range(p*p,n+1,p):
                prime[k]=False
        p+=1

def main():
    a,b,c=[int(k) for k in i().split()]
    s=min(a,b)
    l=max(a,b)
    for k in range(s):
        if (c-k*l)>=0 and (c-k*l)%s==0:
            p("Yes\n")
            break
    else:
        p("No\n")

t=1
#t=int(i())
start=time.perf_counter()
for _ in range(t):
    main()
end=time.perf_counter()
#print(end-start)