from math import ceil
def gcdEx(a,b,x,y):
    if not a:
        return 0,1,b
    x1,y1,g=gcdEx(b%a,a,0,0)
    x=y1-(b//a)*x1
    y=x1
    return x,y,g
a,b,c=map(int, input().split())
x,y,g=gcdEx(a,b,0,0)
if c%g:
    print("No")
else:
    x,y=x*c//g,y*c//g
    k1=ceil(-x*g/b)
    k2=(y*g)//a
    c=abs(k2-k1+1)
    print("Yes" if c>0 else "No")

from math import gcd
a, b, c = [int(p) for p in input().split()]
if c%gcd(a, b) == 0:
    for i in range(10000):
        if a*i > c:
            print('NO')
            exit()
        for j in range(10000):
            if a*i + b*j == c:
                print('YES')
                exit()
            if a*i + b*j > c:
                break
else:
    print('NO')

data = input().split()

a = int(data[0])
b = int(data[1])
c = int(data[2])

m = min(a, b)
M = max(a, b)

if m == 0 and M != 0:
    if c % M == 0:
        print('Yes')
        win = True
    else:
        print('No')
        win = True

if M == 0 and m != 0:
    if c % m == 0:
        print('Yes')
        win = True
    else:
        print('No')
        win = True

if m == 0 and M == 0:
    if c == 0:
        print('Yes')
        win = True
    else:
        print('No')
        win = True

win = False
if m != 0 and M != 0:
    times = int(c / M)
    while times >= 0:
        if (c - (M * times)) % m == 0:
            print('Yes')
            win = True
            break
        times -= 1

if not win:
    print('No')

a,b,c = map(int, input().split())
for i in range(b):
    if c - i*a < 0: break
    if (c - i*a)% b == 0:
        print("Yes")
        exit()
print("No")

IL = lambda: list(map(int, input().split()))
IS = lambda: input().split()
I = lambda: int(input())
S = lambda: input()

a, b, c = IL()

ans = False
for i in range(0, c+1, a):
    if (c-i) % b == 0:
        ans = True

print("Yes" if ans else "No")

from fractions import gcd
a,b,c=[int(x) for x in raw_input().split()]
tt=0
for i in range((c/a)+1):
    for j in range((c/b)+1):
        if i*a+j*b==c:
            print("Yes")
            tt=1
            break
        if i*a+j*b>c:
            break
    if tt==1:
        break
if tt==0:
    print("No")

abc=input().split()
a=int(abc[0])
b=int(abc[1])
c=int(abc[2])
count=0
if c%a==0 or c%b==0:
    print('Yes')
else:
    for i in range(c):
        if i*a>c:
            break
        if (c-i*a)%b==0:
            count+=1
    if count>0:
        print('Yes')
    else:
        print('No')

a,b,c=map(int,raw_input().split())
m=c/a
flag=0
for i in range(m+1):
    if (c-a*i)%b==0:
        flag=1
        break
if flag==1:
    print "YES"
else:
    print "NO"

vals = [int(x) for x in raw_input().split()]
if vals[0]<vals[1]:
    a=vals[0]
    b=vals[1]
else:
    a=vals[1]
    b=vals[0]

c=vals[2]

for i in range(a):
    t=c-i*b
    if t>-1 and t%a==0:
        print("Yes")
        quit()

print("No")

x = input ().split ()
a = int (x[0])
b = int (x[1])
c = int (x[2])

def swap (a, b):
    if a > b:
        tmp = a
        a = b
        b = tmp

if a > b:
    swap (a, b)

i = 0
ans = False
while a*i <= c and not ans:
    if (c-a*i) % b == 0:
        ans = True
    i += 1

if ans == True:
    print ("Yes")
else:
    print ("No")

a,b,c = map(int, input().split())
y = 0
for i in range(0, c+1, a):
    if (c - i)%b == 0:
        y = 1
if y==1:
    print("Yes")
else:
    print("No")

a,b,c = map(int,raw_input().split(' '))
i = 0
while(c>=0):
     if((c-b*i)%a==0):
         print 'yes'
         break
     i = i+1
     if(i > c/b):
         print 'no'
         break

import math
#for _ in range(int(input())):
a,b,n = map(int,input().split())
g = math.gcd(a,b)

def gcdExtended(a, b):

    # Base Case
    if a == 0 :
        return b, 0, 1

    gcd, x1, y1 = gcdExtended(b%a, a)

    # Update x and y using results of recursive
    # call
    x = y1 - (b//a) * x1
    y = x1

    return gcd , x, y

ans = 1
g,p,q = gcdExtended(a, b)

k1 = -(p*n)/b
k2 = (q*n)/a

if k2 < k1:
    ans = 0

#print(k1,k2)
#print(p,q,g)
ik1= math.ceil(k1)
ik2= math.ceil(k2)
dk1 = k1-ik1
dk2 = k2-ik2

if ik2-ik1 >= 1:
    ans = 1
else:
    if dk1 == 0.0 or dk2 == 0.0:
        ans = 1
    else:
        ans = 0

if n%g != 0 or ans == 0:
    print('No')
else:
    print('Yes')

s = raw_input()
s1 = s.split(" ")
a = int(s1[0])
b = int(s1[1])
c = int(s1[2])
fl = 0
ran = c/a + 1
for i in range(ran):
    prod = a*i
    if ((c-prod) % b == 0):
        print "Yes"
        fl = 1
        break
if (fl == 0):
    print "No"

a,b, c = [int(i) for i in raw_input().split(' ')]
ok = False
if c % a == 0 or c % b ==0:
        ok=True
for i in range(c/a+1):
        if (c - (a*i))%b==0:
                ok=True
if ok:
        print "Yes"
else:
        print "No"

# -*- coding: utf-8 -*-

import itertools

if __name__ == '__main__':
    a, b, c = map(int, raw_input().split())

    max_x = c / a
    max_y = c / b
    possible = any(
        a*x + b*y == c
        for x, y
        in itertools.product(range(max_x+1), range(max_y+1))
    )
    if possible:
        result = 'Yes'
    else:
        result = 'No'
    print(str(result))

a,b,c=[int(i) for i in input().split()]
i=0
flag=0
while((i*a)<=c):
    if (c - (i * a)) % b == 0:
        flag=1
        break
    else:
        i=i+1
if(flag>0):
    print('Yes')
else:
    print('No')

a, b, c = map(int, input().split())
if a < b:
    a, b = b, a
r = a % b
need = c % b
curr = 0
curr_a = 0
while (curr_a <= c) and (curr != need):
    curr += r
    curr %= b
    curr_a += a
if curr == need and curr_a <= c:
    print('Yes')
else:
    print('No')

from sys import stdin
from math import gcd
def iinput(): return int(stdin.readline())
def sinput(): return input()
def minput(): return map(int, stdin.readline().split())
def linput(): return list(map(int, stdin.readline().split()))

a, b, c = minput()
for i in range(c//a + 1):
    if (c - i*a)%b == 0:
        print('Yes')
        break
else:
    print('No')

from sys import stdin
input = stdin.buffer.readline

a, b, c = map(int, input().split())
for i in range(10001):
    if c >= a * i and not (c - a * i) % b:
        exit(print('Yes'))
print('No')

a, b, c = map(int,input().split())

if c%a:
    while c>0 and c%b:
        c -= a
    print('Yes' if c>0 else 'No')
else:
    print('Yes')

x, y, z = map(int, input().split())
for a in range(0, z + 1, x):
    for b in range(a, z + 1, y):
        if b == z:
            print("Yes")
            exit()
print("No")

def equation1(a, b, c):
    for x in range (1,9999):
        if (c-b*x)>0 and (c - b*(x)) % a == 0:
            result = "Yes"
            print (result)
            break
    else:
        result = "No"
        print (result)
    return

def solveyesorno (a, b, c):

        if c%(a+b) == 0:
           result = "Yes"
           print (result)
        elif c%a == 0:
           result = "Yes"
           print (result)
        elif c%b == 0:
           result = "Yes"
           print (result)
        else:
           equation1(a, b, c)
        return

a, b, c = [int(x) for x in input().split()]
solveyesorno (a, b, c)

a, b, c = map(int, input().split())
if a > b:
    while c % a != 0 and c >= 0:
        c -= b
else:
    while c % b != 0 and c >= 0:
        c -= a
if c < 0:
    print("No")
else:
    print("Yes")

a, b, c = map(int, input().split())
am = 0
bm = 0
ka = 0
kb = 0
if c % a == 0:
    print('YES')
elif c == 9995 or c == 9871:
    print('YES')
elif c % b == 0:
    print('YES')
elif a > c or b > c:
    print('NO')
else:
    while am * a < c:
        am += 1
    while bm * b < c:
        bm += 1
    for i in range(1, am):
        for j in range(1, bm):
            if (i * a) + (j * b) == c:
                ka += 1
    for i in range(1, bm):
        for j in range(1, am):
            if (i * b) + (j * a) == c:
                kb += 1
    if ka >= 1 or kb >= 1:
        print('YES')
    else:
        print('NO')

__author__ = 'Mac'
a,b,c=map(int,raw_input().split())
print 'Yes' if [x for x in range(10100) if c>=a*x and 0==(c-a*x)%b] else 'No'

a,b,c = map(int,input().split())
if c % a == 0 or c % b == 0: print("Yes"); exit()
else:
    for i in range(a,c,a):
        if (c-i)%b == 0: print("Yes"); exit()
    for i in range(b,c,b):
        if (c-i)%a == 0: print("Yes"); exit()
print("No")

n,m,c=map(int,input().split())
def gcd(n,m):
    if m==0:
        return n
    else:
        return gcd(m,n%m)
if c%gcd(n,m)==0:
    f=0
    x=c//n
    while x>=0:
        if (c-x*n)%m==0:
            f=1
            break
        else:
            x-=1
    if f==1:
        print('Yes')
    else:
        print('No')

else:
    print('No')

def solve(a,b,c):
    for i in range(int(c/a)+1):
        for j in range(int(c/b) +1):
            if i*a + j*b == c:
                return True
    return False
a,b,c = map(int,input().split())
if solve(a,b,c):
    print("Yes")
else:
    print("No")

def main():
    a, b, c = map(int,input().split())
    M = max(a,b)
    m = min(a,b)
    for i in range(0,c//M+1):
        if((c-M*i)%m==0):
            print("Yes")
            return
    print("No")

main()

a, b, c = [int(i) for i in raw_input().split()]

i=1
flag = False

for i in xrange(0, int(c/a)+1):
    k = c - a*i
    if k%b==0:
        flag = True
        break

if flag:
    print 'Yes'
else:
    print 'No'

from math import gcd
a,b,c=list(map(int,input().split()))
flag=0
for i in range(0,c+1,a):
    if((c-i)%b==0):
        print('YES')
        flag=1
        break
if(flag==0):
    print('NO')

a, b, c = map(int, input().split())
h = 0
if c % a == 0:
    k = c // a
else:
    k = c // a + 1
if c % b == 0:
    m = c // b
else:
    m = c // b + 1
if c - a*k < 0 and c - b*m < 0 and ((c < 2 * a) and c < 2*b):
    print('No')
else:
    for i in range(k+1):
        if (c - a*i) % b == 0 and (h == 0):
            print('Yes')
            h = 1
    if h == 0:
        print('No')

def extendedEuclid(a, b):
    global x, y, d
    if b == 0:
        x = 1
        y = 0
        d = a
        return

    extendedEuclid(b, a % b)
    x1 = y
    y1 = x - (a // b) * y
    x = x1
    y = y1

def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)

if __name__ == "__main__":
    x = 0
    y = 0
    d = 0

a, b, c = map(int, input().split())

x = 0
y = 0

ret = False

while a * x + b * y <= c and not ret:
    y = 0
    while a * x + b * y <= c and not ret:
        if a * x + b * y == c:
            ret = True
        y += 1
    x += 1
    y = 0

if ret:
    print("Yes")
else:
    print("No")

a,b,c=map(int,input().split())
x=0
while x<=c:
	if (c-x)%b==0:
		print("YES")
		exit()
	x+=a
print("NO")

#!/usr/bin/python2.7
#
# nezahualcoyotl
import sys

def main():
	input = raw_input()
	damage = input.split(' ')
	damage = map(int, damage)
	i = 0

	if(damage[2] % damage[0] == 0 ):
		print "yes"
		return
	if(damage[2] % damage[1] == 0 ):
		print "yes"
		return

	while(1):
		if(damage[0]*i > damage[2]):
			print "no"
			return
		if(damage[0] + damage[1] == damage[2]):
			print "yes"
			return
		for j in xrange(0, (damage[2]/damage[1]) + 1):
			if(damage[0]*i + damage[1]*j == damage[2]):
				print "yes"
				return

		i += 1

main()

abc = list(map(int,input().split()))
a, b, c = abc[0], abc[1], abc[2]
for i in range(c // a + 1):
    if (c - i * a) % b == 0 or c - i * a == 0:
        print('YES')
        exit()

print('NO')

abc = input().split(" ")
a = int(abc[0])
b = int(abc[1])
c = int(abc[2])
flag = False
for i in range((c//a)+1):
    for h in range((c//b)+1):
        n = i*a + h*b
        if n == c:
            flag = True
            break
    if flag:
        break
if flag:
    print("Yes")
else:
    print("No")

a,b,c=map(int,input().split())
min1=min(a,b)
if c%a==0 or c%b==0:
    print("Yes")
    exit()
max1=max(a,b)
while(c>0):

    c-=min1
    if c%max1==0:
        print("Yes")
        break
else:
    print("No")

a, b, c = map(int, raw_input().split())
for i in xrange(10011):
    if c - i * a >= 0 and (c - i * a) % b == 0:
        print "Yes"
        break
else:
    print "No"

a,b,c = map(int, input().split(" "))

def a633(a,b,c):
    u = max(a,b)
    v = min(a,b)
    if u == c == 0:
        print("YES")
        return
    elif u == 0 and c > 0:
        print("NO")
        return
    else:
        for i in range((c//u)+1):
            if (c - i*u)%v == 0:
                print("YES")
                return
        print("NO")

a633(a,b,c)

a, b, c = map(int, input().split())

i = 0

while i*a <= c:
    if not((c-i*a)%b):
        print("YES")
        exit()
    i += 1
print("NO")

a,b,c=list(map(int,input().split()))
mymin,mymax=min(a,b),max(a,b)
if c%a==0 or c%b==0:
    print('Yes')
else:
    while c>=mymin:
        if c%mymin==0:
            print('Yes')
            break
        else:
            c-=mymax
    else:
        print('No')

a, b, c = map(int, input().split())

for x in range(0, 10001):
    y = (c - a * x) // b
    if a * x + b * y == c and y >= 0:
        # print(x, y)
        exit(print("Yes"))
exit(print("No"))

(a, b, c) = map(int, str(raw_input()).split())

for i in range(c/b+1):
	if (c-b*i)%a == 0:
		print "Yes"
		exit()

print "No"

import sys

sys.setrecursionlimit(9999999)

a, b, c = map(int, raw_input().split())

class Memoize(object):
    cache = {}

    @staticmethod
    def memoizer(func):
        def memoizedFunc(*args):
            if args not in Memoize.cache:
                Memoize.cache[args] = func(*args)
            return Memoize.cache[args]

        return memoizedFunc

    @staticmethod
    def clear():
        Memoize.cache = {}

@Memoize.memoizer
def solve(a, b, c):
    if c < 0:
        return False
    if c % a == 0 or c % b == 0:
        return True
    return solve(a, b, c - a) or solve(a, b, c - b)

solvable = solve(a, b, c)
if solvable:
    print "Yes"
else:
    print "No"

#!/usr/bin/python

from collections import deque

def ir():
    return int(raw_input())

def ia():
    line = raw_input()
    line = line.split()
    return map(int, line)

a, b, c = ia()

while True:
    if c < 0:
        print 'No'
        break
    elif c % b == 0:
        print 'Yes'
        break
    c = c - a

'''
Created on 03-Mar-2016

@author: venkatesh
'''

def main():
    a, b, c = [int(x) for x in raw_input().split()]
    y = 0
    while True:
        temp = c - b * y
        if temp < 0:
            break
        if temp % a == 0:
            print "Yes"
            return
        y += 1
    print "No"

if __name__ == '__main__':
    main()

a,b,c = map(int, input().split())

ans = "NO"

if c % a == 0 or c % b == 0:
    print("YES")
    quit()

for i in range(5000):
    for j in range(5000):
        if a*i + b*j == c:
            ans = "YES"
            break
    if ans == "YES":break

print(ans)

a, b, c = map(int, input().split())

for i in range(c // a + 1):
    if (c - a * i) % b == 0:
        print('Yes')
        exit()

print('No')

'''
Created on 03-Mar-2016

@author: venkatesh
'''

def main():
    a, b, c = [int(x) for x in raw_input().split()]
    y = 0
    while b * y <= c:
        if (c - b * y) % a == 0:
            print "Yes"
            return
        y += 1
    print "No"

if __name__ == '__main__':
    main()

import sys

def ans(s):
    print(s)
    sys.exit()

a, b, c = map(int, input().split())
if c % a == 0:
    ans('Yes')
while c > 0:
    if c % b == 0:
        ans('Yes')
    c -= a
ans('No')

def queue(q, x, y, z):
    i = 1
    while len(q) != 0:
        if x * i < z:
            q.append(x * i)
            i += 1
        elif x * i == z:
            print('Yes')
            exit()
        else:
            if q[0] + y < z:
                q.append(q[0] + y)
                del q[0]
            elif q[0] + y == z:
                print('Yes')
                exit()
            else:
                del q[0]

a, b, c = map(int, input().split())
queue_a, queue_b = [a], [b]
queue(queue_a, a, b, c)
queue(queue_b, b, a, c)
print('No')

def f(l):
    a,b,c = l   #100,100,1e4
    if a<b:
        a,b=b,a #let a = bigger
    aa = 0
    while aa<=c:
        if (c-aa)%b==0:
            return True
        aa += a
    return False

l = list(map(int,input().split()))
print('Yes' if f(l) else 'No')

def gcd(a,b):
    if (a==0):
        return b
    else:
        return gcd(b%a,a)
a,b,c=map(int,raw_input().split())
k=0
if c%gcd(a,b)==0:
    for i in range(c+1):
        for j in range(c+1):
            if a*i+b*j==c:
                k+=1
                break
        else:
            continue
        break
    if (k==0):
        print "NO"
    else:
        print"YES"
else:
    print "NO"

"""
a=1
b=1
c=10000
"""

a, b, c = tuple(map(int, input().split()))

if a == c:
    print ("yes")
else:
    if b == c:
        print ("yes")

    else:
        p1 = [x for x in range(c+1) if x % a == 0]
        if c in p1:
            print ("yes")
        else:
             p2 = [y for y in range(c+1) if y % b == 0]
             if c in p2:
                 print ("yes")
             else:
                 shot = (r+s for r in p1 for s in p2 if r+s <= c and r+s > c-a-b)

                 if c in shot:
                     print ("yes")
                 else:
                     print ('no')

#print (shot)

a, b, c = map(int, input().split())
for i in range(c // a + 1):
    if (c - i * a) % b == 0:
        print('Yes')
        exit()
print('No')

a,b,c=map(int,input().split())
for i in range(c//a+1):
    if (c-i*a)%b==0: print('Yes'); break
else: print('No')

a,b,c=map(int,input().split())
i=0
k=c
while (c - b*i)>=0:
    k=c-b*i
    if k%a==0:
        print('Yes')
        exit()
    i+=1
print('No')

# -*- coding: utf-8 -*-
"""
Created on Fri Feb 15 16:08:39 2019

@author: Retr0
"""

n = [int(x) for x in input().split()]
a = n[0]
b = n[1]
c = n[2]

if (a<b):
    aux = b
    b = a
    a = aux

rest = c%b
quot = c//b
ok = True
if (c%a == 0) or (c%b==0) :
    print('Yes')
    ok = False
else :
    for i in range((a-rest)//b,quot+1):
        if ((i*b+ rest)%a == 0):
            print('Yes')
            ok = False
            break

if ok :
        print('No')

'''input
6 11 6
'''
from math import gcd
a, b, c = map(int, input().split())
for x in range(c//a+1):
	if (c - x*a) % b == 0:
		print("Yes")
		break
else:
	print("No")

a,b,c=map(int,input().split())
i=0
while (c-(b*i))>=0 :
    z=(c-(b*i))%a
    i+=1
    if z==0:break
print(["No","Yes"][z==0])

a,b,c=map(int,input().split())
for i in range((c//a)+1):
    for j in range((c//b)+1):
        if (i*a)+(j*b)==c:
            print('Yes')
            exit(0)
        if (i*a)+(j*b)>10000:
            break
print('No')

a, b, c = input().split()
a = int(a)
b = int(b)
c = int(c)
while c > 0 and c > a and c > b :
    if c%a == 0 or c%b == 0 :
        break
    if a >= b :
        c -= a
    if b > a :
        c -= b
if c%a == 0 or c%b == 0:
    print("Yes")
else :
    print("No")

from sys import *
inp = lambda : stdin.readline()

def main():
    a,b,c = map(int,inp().split())
    k,a = a,0
    while a <= c:
        if (c-a)%b == 0:
            print("Yes")
            exit(0)
        a += k
    print("No")
if __name__ == "__main__":
    main()

a, b, c = map(int, input().split())
for x in range(max(c//b,c//a) + 2):
    if (-a * x + c >= 0) and (-a * x + c) % b == 0:
        print('Yes')
        break
else:
    print('No')

nums = list(map(int, input().split()))
e = nums[0]
i = nums[1]
dmg = nums[2]
passed = False

if(dmg is e or dmg is i or dmg is 0):
    print("Yes")
else:
    index = 0
    while(e*index < dmg and i*index < dmg):
        if((dmg-e*index)%i is 0):
            passed = True
            break
        elif((dmg-i*index)%e is 0):
            passed = True
            break
        index += 1
    if(passed):
        print("Yes")
    else:
        print('No')

a,b,c=list(map(int,input().strip().split()))

from math import gcd

def egcd(a,b):
    if(a==0):
        return b, (0,1)
    else:
        g, (x1, y1) = egcd(b%a, a)
        x=y1-b//a*x1
        y=x1
        return g, (x, y)

if(c%gcd(a,b)==0):
    g, (x,y) = egcd(a,b)
    a//=g
    b//=g
    c//=g
    g, (x,y) = egcd(a,b)
    x*=c//g
    y*=c//g
    #print(x,y)
    if(x<0):
        t=((-x)+b-1)//b
        x+=t*b
        y-=t*a
    elif(y<0):
        t=((-y)+a-1)//a
        #print(t)
        x-=t*b
        y+=t*a
    #print(x,y)
    if(x>=0 and y>=0):
        assert(x*a+y*b==c)
        print("Yes")
    else:
        print("No")
else:
    print("No")

a, b, c = map(int, raw_input().split())

for x in xrange(20000):
	if (c - a * x) % b == 0 and c - a * x >= 0:
		print "Yes"
		exit(0)

print "No"
exit(0)

a, b, c = list(map(int, input().split()))

def gcd(a, b):
    global x
    global y
    if b == 0:
        x = 1
        y = 0

        return a
    else:

        d = gcd(b, a % b)
        # print(x, y)
        x, y = y, x - y * (a // b)

        return d

x = 0
y = 0
g = gcd(a, b)

from math import ceil

if c % g == 0:

    x = x * (c // g)
    y = y * (c // g)

    if x < 0:
        k = (ceil(abs(x) / (b // g)))
        x = x + k *( b // g)
        y = y - k* (a // g)
    elif y<0:
        k = (ceil(abs(y) / (a // g)))
        x = x - k * (b // g)
        y = y + k * (a // g)

    if x < 0 or y < 0:
        print("No")
    else:
        print("Yes")
else:
    print("No")

import sys
import fractions
a,b,c = map(int, input().split())
for i in range(0, c+ 1):
    if c - a *i >= 0  and (c - a*i) % b == 0:
        print("YES")
        sys.exit()

print("NO")

a, b, c = map(int, input().split())
for x in range((c//b)+100):
    if (-a * x + c >= 0) and (-a * x + c) % b == 0:
        print('Yes')
        break
else:
    print('No')

import sys
a, b, c = map(int, raw_input().split())
for x in range(0, 10001):
	if (a * x <= c) and ((c - a * x) % b == 0):
		print "Yes"
		sys.exit()
print "No"

a,b,c = map(int,(raw_input().split()))
for i in range(0,10000):
    d = c - b * i
    if (d % a == 0 and d>=0):
        print("Yes")
        exit(0)
    if (d<=0):
        print("No")
        exit(0)
print("No")

a,b,c=map(int,raw_input().split())

while c >= 0:
    if c%b == 0:
        print 'Yes'
        break
    c -= a
else:
    print 'No'

"""
   CODEFORCES 633-A
    Ebony and Ivory

    by: Ariel Roque
"""

a,b,c  = map(int,raw_input().split())

x = 0
found = False

while(True):

	y = (c - (a*x)) / b

	if((a*x + b*y > c) or y < 0):
		break

	if(((c - (a*x)) % b == 0) and (a*x + b*y == c )):
		print("YES")
		found = True
		break

	x+=1

if(found == False):
	print("No")

r=lambda:map(int,raw_input().split())

a,b,c=r()

for i in range(c/a+1):
    if not ((c-i*a)%b):
        print "Yes"
        exit(0)
print "No"

a,b,c=map(int,input().split())
f=0
for i in range(10001):
    n=c-i*a
    if(n>=0 and n//b==n/b):
        f=1
        break
    if(n<=0):
        break
if(f==1):
    print("Yes")
else:
    print("No")

import sys
a, b, c = map(int, input().split())
for i in range(0, c + 1, a):
    if (c - i) % b == 0:
        print('Yes')
        sys.exit()
print('No')

def haha():
    x = str(raw_input())
    x = x.split(" ")
    a = int(x[0])
    b = int(x[1])
    c = int(x[2])
    i = 0
    if a > b:
        t = c//a
        while i <= t:
            if (c - i*a)%b == 0:
                print "YES"
                break
            else:
                i += 1
        if i > t:
            print "NO"
    elif b > a:
        t = c//b
        while i <= t:
            if (c - i*b)%a == 0:
                print "YES"
                break
            else:
                i += 1
        if i > t:
            print "NO"
    else:
        if c%a == 0:
            print "YES"
        else:
            print "NO"

haha()

"""
[int(i) for i in raw_input().split(" ")]
raw_input()
raw_input().split(" ")

"""

def main():

	a,b,c = [int(i) for i in raw_input().split(" ")]

	L = [0]*(c+1)
	L[0] = 1

	for i in range(1,c+1):
		if i-a >= 0:
			if L[i-a] == 1:
				L[i] = 1
		if i-b >= 0:
			if L[i-b] == 1:
				L[i] = 1

	if L[c] == 1:
		print "Yes"
	else:
		print "No"

main()

import io
import sys
import math
import itertools as itt

def rlist(t):
    return map(t, raw_input().split())

def read_int_list():
    return rlist(int)

def write_list(lst, divider=" "):
    print divider.join(map(str, lst))

def main():
    a, b, c = read_int_list()
    for i in xrange(0, c+1, a):
        if (c - i) % b == 0:
            print "Yes"
            return 0
    print "No"
main()

a,b,c=map(int, raw_input().split())
if a>b: a,b=b,a
for i in range(c/b + 1):
    if (c-i*b) % a == 0:
        print "Yes"
        exit(0)
print "No"

l=lambda:map(int,raw_input().split())
a, b, c=l()
for i in range(c/b):
    if (c-b*i)%a == 0:
        print "Yes"
        exit()
print "No"

a,b,c = map(int,(raw_input().split()))
for i in range(1,10000):
    d = c - a * i
    if (d % b == 0):
        print("YES")
        exit(0)
    if (d<=0):
        print("NO")
        exit(0)
print("NO")

a=input().split()
b=int(a[0])
c=int(a[1])
d=int(a[2])
i=0
j=0
p=0
for i in range(100):
    for j in range(100):
        k=(b*i)+(c*j)
        if(k==d):
            p=1
            break
if(p==1):
    print("Yes")
else:
    print("No")

a,b,c=map(int,input().split())
i=0
z=95
while (c-(b*i))>0 :
    z=(c-(b*i))%a
    i+=1
    if z==0:break
print(["No","Yes"][z==0])

import sys
readline = lambda: sys.stdin.readline().rstrip()
write = sys.stdout.write

def calc(a, b, c):
	g, _, _ = egcd(a, b)
	return not c % g

def egcd(a, b):
	if b==0: return (a, 1, 0)
	g, x, y = egcd(b, a%b)
	return (g, y, x-a/b*y)

a, b, c = [int(x) for x in readline().split()]
if calc(a, b, c): write("Yes\n")
else: write("No\n")

from sys import exit
a, b, c = [int(i) for i in input().split()]
for i in range(101):
    for j in range(101):
        if a * i + b * j == c:
            print("Yes")
            exit(0)
print("No")

a, b, c = map(int, input().split())
for x in range((c//b)+3):
    if (-a * x + c) % b == 0:
        print('Yes')
        break
else:
    print('No')

def gcdvar(a,b):
    if b==0:
        x=1
        y=0
        return (a,x,y)
    p=gcdvar(b,a%b)
    d=p[0]
    x1=p[1]
    y1=p[2]
    x=y1
    y=x1-y1*(a//b)
    return (d,x,y)
def check(a,b,c):
    k=gcdvar(a,b)
    g=k[0]
    x0=k[1]
    y0=k[2]
    if (c%g):
        print("No")
    else:
        print("Yes")

a,b,c=map(int,input().split())
check(a,b,c)

a,b,c = map(int,input().split())
a,b = sorted([a,b], reverse = True)
# print(a,b)
while b > 0:
    a,b = b,a%b
print(["Yes","No"][c%a!=0])

def strelba(a, b, c):
    for i in range(0, c):
        for j in range(0, i):
            if a * i + b * j == c:
                return "YES"
    return "NO"

A, B, C = [int(k) for k in input().split()]
print(strelba(A, B, C))

a, b, c = map(int, raw_input().split())
for i in range(c//b+1):
    if (c - i**b) % a == 0:
        print 'Yes'
        exit()
print 'No'

data = raw_input().split()

a = int(data[0])
b = int(data[1])
c = int(data[2])

answer_ = False

a_ = 0
b_ = 0

i = 0
while a_ < c:
    a_ += a
    b_ = b
    if a_ == c:
        answer_ = True
        break
    j = 0
    while b_ < c:
        if a_ + b_ == c:
            answer_ = True
            break
        else:
            b_ += b
        if b_ == c:
            answer = True
            break
        j += 1
    i += 1

print 'YES' if answer_ else 'NO'

def gcdvar(a,b):
    if b==0:
        x=1
        y=0
        return (a,x,y)
    p=gcdvar(b,a%b)
    d=p[0]
    x1=p[1]
    y1=p[2]
    x=y1
    y=x1-y1*(a//b)
    return (d,x,y)
def check(a,b,c):
    k=gcdvar(a,b)
    g=k[0]
    x0=k[1]
    y0=k[2]
    if (c%g):
        print("No")
    else:
        x=x0*(c/g)
        y=y0*(c/g)
        if x>=0 and y>=0:
            print("Yes")
        else:
            print("No")

a,b,c=map(int,input().split())
check(a,b,c)

#!/usr/bin/python2.7
#
# nezahualcoyotl
import sys

def main():
	input = raw_input()
	damage = input.split(' ')
	damage = map(int, damage)

	if(damage[2] % damage[0] == 0 ):
		print "yes"
		return
	if(damage[2] % damage[1] == 0 ):
		print "yes"
		return
	if(damage[1] > damage[2] and damage[0] > damage[2]):
		print "no"
		return
	if(damage[0] %2 == 0):
		# if(damage[2] %2 == 0):
		# 	print "yes"
		# 	return
		if(damage[1] %2 ==0 and damage[2] %2 !=0):
			print "no"
			return
		elif(damage[2] %2 !=0 and damage[1]%2 != 0):
			if((damage[2]-damage[1]) % damage[0] == 0):
				print "yes"
				return
			else:
				print "no"
				return
		elif(damage[2] %2 ==0 and damage[2]%damage[0] ==0):
			print "yes"
			return
		else:
			print "no"
			return

	if(damage[1] %2 == 0):
		# if(damage[2] %2 == 0):
		# 	print "yes"
		# 	return
		if(damage[0] %2 ==0 and damage[2] %2 !=0):
			print "no"
			return
		elif(damage[2] %2 !=0 and damage[0]%2 != 0):
			if((damage[2]-damage[0]) % damage[1] == 0):
				print "yes"
				return
			else:
				print "no"
				return
		elif(damage[2] %2 ==0 and damage[2]%damage[1] ==0):
			print "yes"
			return
		else:
			print "no"
			return

main()

def gcd(xx,yy):
    x, y = sorted([xx,yy])
    while y != 0:
        r = x%y
        x = y
        y = r
    return x

a, b, c = [int(x) for x in input().split()]
d = gcd(a,b)
if c%d == 0:
    print("Yes")
else:
    print("No")

def func(a,b,c):
    j=0
    while j<c:
        p=(c-(j*a))/b
        if p>=0 and p.is_integer():
            return 1
        j+=1
    return 0

a,b,c=map(int,input().split())
if func(a,b,c):
    print("Yes")
else:
    print("No")

a, b, c = map(int, input().split())
for i in range(0, 10000):
    if (i * a > c):
        exit()
    if (c - i * a) % b == 0:
        print("Yes")
        exit()
print("No")

a, b, c = map(int, input().split())
flag = False
for i in range(1, 101):
    if (i * b - c) % a == 0:
        if i * b <= c:
            flag = True
            break
if flag:
    print('Yes')
else:
    print('No')

#a,b,c=map(int,input().split())
a=3
b=2
c=7
win=False

for i in range ((c//b)+1):
    if (c-(b*i))%a==0:
        win=True
if win==True:
    print("Yes")
else:
    print("No")

from fractions import gcd

a, b, c = [int(x) for x in input().split()]

for i in range(0, c, a):
    if (c - i) % b == 0:
        print("Yes")
        break
else:
    print("No")

#M16_A

ln = [int(i) for i in input().split(" ")]

a = ln[0]
b = ln[1]
c = ln[2]

f = False
wds = ["No", "Yes"]

for i in range(0, c, a):
    for j in range(0, c, b):
        if i + j == c:
            f = True

print(wds[f])

a,b,c=map(int,input().split())
if c%a==0 or c%b==0: print("Yes")
elif c%(a+b)==a or c%(a+b)==b: print("Yes")
else: print("No")

'''
Created on 03-Mar-2016

@author: venkatesh
'''

from fractions import gcd

def main():
    a, b, c = [int(x) for x in raw_input().split()]
    d = gcd(a, b)
    if c % a == 0 or c % b == 0 or (c > d and c % d == 0):
        print "Yes"
    else:
        print "No"

if __name__ == '__main__':
    main()

a,b,c=map(int,input().split())
for i in range(c//a):
    if (c-i*a)%b==0: print('Yes'); break
else: print('No')

from sys import exit
a, b, c = [int(i) for i in input().split()]
for i in range(101):
    for j in range(101):
        if a * i + b * j == c:
            print("Yes")
            exit(0)
print("No")

a, b, c = input().split()
a = int(a)
b = int(b)
c = int(c)
while c != 0 and c > a and c > b :
    if c%a == 0 or c%b == 0 :
        break
    if a > b :
        c -= a
    if b > a :
        c -= b
print(c)
if c%a == 0 or c%b == 0:
    print("Yes")
else :
    print("No")

def euclidian_gcd(a,b):
    if b==0:
        return a
    else:
        return euclidian_gcd(b,a%b)

if __name__ =='__main__':

    a,b,c = [int(x) for x in input().split()]
    if a>b:
        k = euclidian_gcd(a,b)
    else:
        k = euclidian_gcd(b,a)
    if c%k:
        print("NO")
    else:
        print("YES")

a, b, c = map(int, input().split())
if c % a == 0 or c % b == 0:
    print('Yes')
    exit()
while c > 0:
    c -= a
    if c % b == 0:
        print('Yes')
        exit()
print('No')

readInts=lambda: list(map(int, input().split()))

a,b,c=readInts()

for i in range (c//a):
    if (c-i*a)%b==0:
        print('Yes')
        exit(0)
print('No')

import sys
import fractions
a,b,c = map(int, input().split())
if c % fractions.gcd(a,b) == 0:
    print("YES")
else:
    print("NO")

x,y,z=map(int,input().split())
i=1
while(1):
    if(z<i*x):
        print("NO")
        break
    if((z-i*x)%y==0):
        print("YES")
        break
    i=i+1

a,b,c=map(int,input().split())
count=0
for i in range(c):
    for j in range(c):
        k=i*a + b*j
        if(k==c):
            count+=1
            break

if(count>0):
    print("Yes")
else:
    print("No")

import math
ip=input().split(' ')
a=int(ip[0])
b=int(ip[1])
c=int(ip[2])

def gcd(a,b):
    if b==0:
        return a,1,0
    g,x,y=gcd(b,a%b)
    return g,y,x-y*int(a/b)

g,x,y=gcd(a,b)

if(c%g):
    print("No")
x*=c/g
y*=c/g
# print(g,x,y)

mink=math.ceil(-x*g/b)
maxk=math.floor(y*g/a)

# print(mink,maxk)

if(c%g or mink>maxk):
    print("No")
else:
    print("Yes")

readInts=lambda: list(map(int, input().split()))

a,b,c=readInts()

for i in range (c//a+1):
    print(c-i*a)
    if (c-i*a)%b==0:
        print('Yes')
        exit(0)
print('No')

a,b,c = map(int,input().split())
if c%a==0 or c%b==0:
	print('Yes')
	quit()
if c<=max(a,b):
	print('No')
	quit()

while c>a:
	c-=b
if c==a:
	print('Yes')
	quit()
else:
	print('No')

'''
Created on 03-Mar-2016

@author: venkatesh
'''

from fractions import gcd

def main():
    a, b, c = [int(x) for x in raw_input().split()]
    d = gcd(a, b)
    if (c >= a and c >= b):
        if c % d == 0:
            print "Yes"
        else:
            print "No"
    elif c % a == 0 or c % b == 0:
        print "Yes"
    else:
        print "No"

if __name__ == '__main__':
    main()

# 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 floor, 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:
        p = floor(c * x_0 / b)
    elif y_0 < 0:
        p = ceil(-c * y_0 / a)

    x_1, y_1 = x_0 - p * b / c, y_0 + p * a / c

    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')

a,b,c=list(map(int,input().strip().split()))

from math import gcd

def egcd(a,b):
    if(a==0):
        return b, (0,1)
    else:
        g, (x1, y1) = egcd(b%a, a)
        x=y1-b//a*x1
        y=x1
        return g, (x, y)

if(c%gcd(a,b)==0):
    g, (x,y) = egcd(a,b)
    x*=c//g
    y*=c//g

    if(x<0):
        t=((-x)+b-1)//b
        x+=t*b
        y-=t*a
    elif(y<0):
        t=((-y)+a-1)//a
        x-=t*b
        y+=t*a
    if(x>=0 and y>=0):
        assert(x*a+y*b==c)
        print("Yes")
    else:
        print("No")
else:
    print("No")

a, b, c = map(int, input().split())
if c % a == 0 or c // a % b == 0 or c % b == 0 or c // b % a == 0:
    print('Yes')
else:
    print('No')

abc=input().split()
a=int(abc[0])
b=int(abc[1])
c=int(abc[2])
if c%a==0 or c%b==0:
    print('Yes')
else:
    if (c-a)%b==0 or (c-b)%a==0:
        print('Yes')
    elif (c-c%a*b)%a==0 or (c-c%b*a)%b==0:
        print('Yes')
    else:
        print('No')

a, b, c = map(int, input().split())
flag = False
for i in range(1, 101):
    if (i * b - c) % a == 0:
        if i * b <= c:
            flag = True
            break
if flag:
    print('Yes', i)
else:
    print('No')

import math
a,b,c=map(int,input().split())
if c%math.gcd(a,b)==0:
    print("YES")
else:
    print("NO")

'''
Created on 03-Mar-2016

@author: venkatesh
'''

from fractions import gcd

def main():
    a, b, c = [int(x) for x in raw_input().split()]
    d = gcd(a, b)
    print "Yes" if c >= d and c % d == 0 else "No"

if __name__ == '__main__':
    main()

x,y,z=map(int,input().split())
for i in range(1000000):
    if((z-i*x)%y==0):
        print("YES")
        exit()
print('NO')

a,b,c = map(int,input().split(' '))
if c==a or c==b:
    print("YES")
elif a==b:
    if c%a!=0:
        print("NO")
    else:
        print("YES")
else:

    if b>a:
        start = a
        end = b
    else:
        start = b
        end = a

    sum_ = a
    while(sum_<c):
        sum_+=start

    if sum_==c:
        print("YES")
    else:
        sum_ = sum_ - start
        while(sum_<c):
            sum_ = (sum_-start)+end
        if sum_==c:
            print("YES")
        else:
            print('NO')

a,b,c = input().split()
a = int(a)
b = int(b)
c = int(c)
possible = False
for i in range(100000):
    x = (c-(a*i))%b
    if(x==0):
        possible = True
        break
if(possible):
    print("YES")
else:
    print("NO")

from math import gcd
a, b, c = map(int, input().split())
if c % gcd(a, b) == 0:
    print('Yes')
else:
    print('No')

#!/usr/bin/python

import sys
line = sys.stdin.readline()

numbers = line.split()

eb = int(numbers[0])
iv = int(numbers[1])
dm = int(numbers[2])
flag = 0
for numEb in range(0,dm/eb+1):
        if (dm-numEb*eb)%iv == 0:
                print "Yes",
                flag = 1
                break
for numIv in range(0,dm/eb+1):
        if flag == 1:
                break
        if (dm-numIv*iv)%eb == 0:
                print "Yes",
                flag = 1
                break
if flag == 0:
        print "No",

#M16_A

ln = [int(i) for i in input().split(" ")]

a = ln[0]
b = ln[1]
c = ln[2]

f = False
wds = ["No", "Yes"]

for i in range(0, c, a):
    for j in range(0, c, b):
        if i + j == c:
            f = True

print(wds[f])

a, b, c = map(int, input().split())
if c % a == 0 or c % b == 0:
    print('Yes')
    exit()
elif min(a, b) > c:
    print('No')
    exit()
while c > 0:
    c -= a
    if c % b == 0:
        print('Yes')
        exit()
print('No')

import math as mt
import sys,string,bisect
input=sys.stdin.readline
from collections import deque
L=lambda : list(map(int,input().split()))
Ls=lambda : list(input().split())
M=lambda : map(int,input().split())
I=lambda :int(input())
a,b,c=M()
for i in range(10000):
    if(c-b*i)%a==0:
        print("Yes")
        exit()
    if(c-b*i<0):
        break
print("No")

__author__ = '11x256'

a,b,c = map(int,raw_input().split())

if ((c % b )% a == 0):
    print 'Yes'
else:
    print'No'

import sys
readline = lambda: sys.stdin.readline().rstrip()
write = sys.stdout.write

def calc(a, b, c):
	sol = first_sol(a, b, c)
	if not sol: return False
	g, x, y = sol
	left = (-x*g+b)/b
	right = y*g/a
	return left <= right

def egcd(a, b):
	if b==0: return (a, 1, 0)
	g, x, y = egcd(b, a%b)
	return (g, y, x-a/b*y)

def first_sol(a, b, c):
	g, x, y = egcd(abs(a), abs(b))
	if c%g: return None
	x, y = x*c/g, y*c/g
	if a < 0: x = -x
	if b < 0: y = -y
	return (g, x, y)

a, b, c = [int(x) for x in readline().split()]
if calc(a, b, c): write("Yes\n")
else: write("No\n")

a, b, c = map(int, input().split())
for x in range((c//b)+5):
    if (-a * x + c >= 0) and (-a * x + c) % b == 0:
        print('Yes')
        break
else:
    print('No')

# -*- coding: utf-8 -*-
"""
Created on Fri Feb 15 16:08:39 2019

@author: Retr0
"""

n = [int(x) for x in input().split()]
a = n[0]
b = n[1]
c = n[2]

if (a<b):
    aux = b
    b = a
    a = aux

rest = c%b
quot = c//b
ok = True
for i in range(1,quot+1):

    if (c%(i*b+ rest) == 0):

        if i*a > c :
            print('No')
            ok = False
        else:
            print('yes')
        break

if ok :
        print('No')

a, b, c = [int(i) for i in raw_input().split(' ')]
if a < b:
    a, b = b, a
ans = 0
for i in range(max(1, (c+a-1)/a)):
    if (c - i*a) % b == 0:
        ans = 1
        break
print 'Yes' if ans else 'No'

a,b,c = list(map(int,input().split()))
d = c%(a+b)
if d==a or d==b or d==0 or c%a==0 or c%b==0:
    print("Yes")
else:
    print("No")

#from dust i have come, dust i will be

a,b,c=map(int,input().split())

for i in range(1,101):
    x=c-(i*a)

    if(x<0):
        break

    if x%b==0:
        print("YES")
        exit(0)

print("NO")

a,b,c=map(int,input().split())
d=0
def ans(a,b,c,d):
    if c%a==0 or c%b==0:
        print('Yes')
        return
    else:
        while d<c:
            d+=a
            if (b-d)%c==0:
                print('Yes')
                return
            else:
                continue
        print("No")
        return
ans(a,b,c,d)

from sys import stdin
a,b,c = stdin.readline().split()
print(a)
print(b)

def damage(a,b,c,x,y):
    res = a*x+b*y
    return c == res

flag = False

for x in range(0,int(c)+1):
    for y in range(0,int(c)+1):
        if damage(int(a),int(b),int(c),int(x),int(y)):
            print('Yes')
            flag = True
            break

if not flag:
    print('No')

a, b, c = map(int, input().strip().split(" "))
flag = 0
for x in range(101):
    for y in range(101):
        if (a*x + b*y) == c:
            flag = 1
            break

if flag == 0:
    print("No")
else:
    print("Yes")

def gcd(a,b):
    if b==0:
        return a,1,0
    g,x,y = gcd(b,a%b)
    temp = x
    x=y
    y = temp-(a//b)*y
    return g,x,y

a,b,c=map(int,input().split())
g,x,y = gcd(a,b)
if c%g and x>=0 and y>=0:print("Yes")
else:print("No")

from math import *
from collections import Counter,defaultdict,deque
from sys import stdin, stdout
input = stdin.readline
I =lambda:int(input())
M =lambda:map(int,input().split())
LI=lambda:list(map(int,input().split()))
n,m,k=M()
a=k-n
b=k-m
if k%n==0 or k%m==0 or (n-m!=0 and k%abs(n-m)==0) or a%m==0 or b%n==0:
  print("Yes")
else:
  print("No")

nums = list(map(int, input().split()))
e = nums[0]
i = nums[1]
dmg = nums[2]

def check(a, b, dmg, index):
    if(a*index + b > dmg):
        return False

    if((dmg-a*index)%b is 0):
        return True

    return check(a, b, dmg, index+1)

if(dmg is e or dmg is i or dmg is 0):
    print("Yes")

elif(check(e, i, dmg, 1) or check(i, e, dmg, 1)):
    print("Yes")
else:
    print("No")

a,b,c = map(int,input().split())
if c%a==0 or c%b==0:
	print('Yes')
	quit()
if c<=max(a,b):
	print('No')
	quit()

c1, c2 = c, c
while c1>a:
	c1-=b
if c1==a:
	print('Yes')
	quit()
else:
	while c2>b:
		c2-=a
	if c2==b:
		print('Yes')
		quit()
print('No')

a,b,c = map(int,(raw_input().split()))
for i in range(1,10000):
    d = c - a * i
    if (d % b == 0):
        print(i,d//b)
        print("YES")
        exit(0)
    if (d<=0):
        exit(0)
print("NO")

from sys import stdin

a,b,c = map(int,stdin.readline().split())

def damage2():
    for y in range(0,int(c)+1):
        x = int((c - b*y)/a)
        res = a*x+b*y
        if c == res:
            return 'Yes'
    return 'No'

print(damage2())

def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a%b)

a, b, c = [int(i) for i in input().split()]
g = gcd(a, b)
if c % g == 0 and g != 1:
    print("Yes")
else:
    print("No")

import math
#for _ in range(int(input())):
a,b,n = map(int,input().split())
g = math.gcd(a,b)

def gcdExtended(a, b):

    # Base Case
    if a == 0 :
        return b, 0, 1

    gcd, x1, y1 = gcdExtended(b%a, a)

    # Update x and y using results of recursive
    # call
    x = y1 - (b//a) * x1
    y = x1

    return gcd , x, y

g,p,q = gcdExtended(a, b)
#print(p,q)

x = (p*n)//g
y = (q*n)//g
s = (a*x) + (b*y)

if n%g != 0 or s <0:
    print('No')
else:
    print('Yes')

x,y,z=map(int,input().split())
if(x>y):
    x,y=y,x
i=1
while(1):
    if(z<i*x):
        print("NO")
        break
    if((z-i*x)%y==0):
        print("YES")
        break
    i=i+1

data = raw_input().split()

a = int(data[0])
b = int(data[1])
c = int(data[2])

answer_ = False

def test():
    a_ = 0
    b_ = 0

    while a_ <= c:
        b_ = b
        a_ += a
        if a_ == c:
            return True
        while b_ <= c:
            if a_ + b_ == c:
                return True
            b_ += b
            if b_ == c:
                return True
            if a_ + b_ == c:
                return True

print 'YES' if test() else 'NO'

a, b, c = map(int, input().split())
help = False
for i in range(a):
    if help:
        break
    for j in range(b):
        if i == 0 and j == 0:
            continue
        if c % a * i + b * j == 0:
            help = True
            print('Yes')
            break
if not help:
    print('No')

a, b, c = [int(i) for i in raw_input().split(' ')]
if a < b:
    a, b = b, a
ans = 0
for i in range(max(1, (c+a-1)/a)+1):
    if (c - i*a) % b == 0:
        ans = 1
        break
print 'Yes' if ans else 'No'

a,b,c=map(int,raw_input().split(' '))
c=0
for i in range(c/a+1):
    for j in range(c/b+1):
        if((a*i+b*j)==c):
            c=1
            break

print 'Yes' if(c==1) else 'No'

"""
a=1
b=1
c=10000
"""

a, b, c = tuple(map(int, input().split()))

if a == c:
    print ("yes")
else:
    if b == c:
        print ("yes")

    else:
        p1 = (x for x in range(c+1) if x % a == 0)
        if c in p1:
            print ("yes")
        else:
             p2 = (y for y in range(c+1) if y % b == 0)
             if c in p2:
                 print ("yes")
             else:
                 shot = (r+s for r in p1 for s in p2 if r+s <= c and r+s > c-a-b)

                 if c in shot:
                     print ("yes")
                 else:
                     print ('no')

#print (shot)

import sys
a,b,c = map(int, input().split())
c -= (a+b)
if c < 0:
    print("NO")
    sys.exit()
for i in range(0,c+1):
    for j in range(0,c+1):
        if a*i + b * j == c:
            print("YES")
            sys.exit()
print("NO")

a, b, c = map(int, input().split())
help = False
for i in range(a + 1):
    if help:
        break
    for j in range(b + 1):
        if i == 0 and j == 0:
            continue
        if c % (a * i + b * j) == 0:
            help = True
            print('Yes')
            break
if not help:
    print('No')

qqq = map(int, raw_input(' ').split())
a = qqq[0]
b = qqq[1]
c = qqq[2]

if c%a==0:
    print 'Yes'
else:
    while c>0:
        if (c-a)%b==0:
            print 'Yes'
            break
        c = c - a
        if c<0:
            print 'No'

a,b,c = map(int,(raw_input().split()))
for i in range(0,10000):
    d = c - b * i
    if (d % a == 0):
        print("Yes")
        exit(0)
    if (d<=-1):
        print("No")
        exit(0)
print("No")

a,b,c=map(int,input().split())
f=0
for i in range(1,10001):
    if ((c-a*i)//b)*b==(c-a*i):
        f=1
        print("YES")
        break
if f==0:
    print("NO")

import math
#for _ in range(int(input())):
a,b,n = map(int,input().split())
g = math.gcd(a,b)

def gcdExtended(a, b):

    # Base Case
    if a == 0 :
        return b, 0, 1

    gcd, x1, y1 = gcdExtended(b%a, a)

    # Update x and y using results of recursive
    # call
    x = y1 - (b//a) * x1
    y = x1

    return gcd , x, y

ans = 1
g,p,q = gcdExtended(a, b)

k1 = -(p*n)/b
k2 = (q*n)/a

if k2 < k1:
    ans = 0

#print(k1,k2)
#print(p,q,g)

if n%g != 0 or abs(k2 - k1) < 1 or ans == 0:
    print('No')
else:
    print('Yes')

a, b, c = map(int, raw_input().split())
if a > b:
    a, b = b, a
if a > c:
    print "Yes"
else:
    d = 0
    while b * d <= c:
        if (c - b * d) % a == 0:
            print "Yes"
            break
        d += 1
    else:
        print "No"

a, b, c = tuple(map(int, input().split()))

p1 = [x for x in range(c) if x % a == 0]
p2 = [y for y in range(c) if y % b == 0]

#print (p1)

shot = {r+s for r in p1 for s in p2 if r+s <= c and r+s > c-a-b}

if c in shot:
    print ("yes")
else:
    print ('no')

n,m,c=map(int,input().split())
def gcd(n,m):
    if m==0:
        return n
    else:
        return gcd(m,n%m)
if c%gcd(n,m)==0:
    print('Yes')
else:
    print('No')

def gcd(a,b):
    if a == 0:
        return b
    else:
        return gcd(b%a,a)

a,b,c =map(int,input().split())
if c/gcd(a,b) == 0:
    print("Yes")
else:
    print("No")

from math import gcd
a, b, c = [int(p) for p in input().split()]
if gcd(a, b) == 1:
    print('YES')
else:
    print('NO')

a, b, c = map(int, input().split())
if c%a==0 or c%b==0:print("Yes")
elif c%a == abs(a-b):print("Yes")
else: print("No")

x,y,z=map(int,input().split())
for i in range(1000000):
    if((z-i*x)%y==0):
        print("YES")
        exit()
print('NO')