import sys,random,bisect
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from itertools import permutations
from math import log,gcd

input = lambda :sys.stdin.readline()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

N,M,K = mi()

a = M/N
b = (M*(N-1))/(N-K-1)*N

if M*N*(N-K-1) < M*(N-1)*N:
    p,q = M*(N-1),(N-K-1)*N
    g = gcd(p,q)
    print(p//g,q//g)
else:
    p,q = M,N
    g = gcd(p,q)
    print(p//g,q//g)