import sys

sys.setrecursionlimit(10 ** 6)
from bisect import *
from collections import *
from heapq import *

int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def SI(): return sys.stdin.readline()[:-1]
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
def MF(): return map(float, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LF(): return list(map(float, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
dij = [(0, 1), (1, 0), (0, -1), (-1, 0)]

def gcd(a,b):
    while b:a,b=b,a%b
    return a

def main():
    a,b,t=MI()
    g=gcd(a,b)
    if t>=a*b//g:
        ans=(t+g-1)//g
    else:
        hp=[]
        fin=set()
        heappush(hp,0)
        while 1:
            x=heappop(hp)
            if x>=t:
                ans=x
                break
            if x+a not in fin:
                heappush(hp,x+a)
                fin.add(x+a)
            if x+b not in fin:
                heappush(hp,x+b)
                fin.add(x+b)
    print(ans)

main()