import bisect import copy import decimal import fractions import heapq import itertools import math import random import sys import time from collections import Counter,deque,defaultdict from functools import lru_cache,reduce from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max def _heappush_max(heap,item): heap.append(item) heapq._siftdown_max(heap, 0, len(heap)-1) def _heappushpop_max(heap, item): if heap and item < heap[0]: item, heap[0] = heap[0], item heapq._siftup_max(heap, 0) return item from math import gcd as GCD read=sys.stdin.read readline=sys.stdin.readline readlines=sys.stdin.readlines write=sys.stdout.write A,B,T=map(int,readline().split()) g=GCD(A,B) A//=g B//=g T=(T+g-1)//g if A*B-A-BB: A,B=B,A for b in range(T+1): if b*B>T: break ans=min(ans,b*B+(T-b*B)+(b*B-T)%A) ans*=g print(ans)