import sys

int1 = lambda x: int(x) - 1

# input = lambda: sys.stdin.buffer.readline()
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
i1 = lambda: int1(input())
mi = lambda: map(int, input().split())
mi1 = lambda: map(int1, input().split())
li = lambda: list(mi())
li1 = lambda: list(mi1())
lli = lambda n: [li() for _ in range(n)]

INF = float("inf")
# mod = int(1e9 + 7)
mod = 998244353


n, m, k = mi()
ans1 = m / n
ans2 = (m / n) * ((m - 1) / (n - 1 - k)) + ((n - m) / n) * (m / (n - 1 - k))
ans2 = (m * ((m - 1) + (n - m))) / (n * (n - 1 - k))

from math import gcd

if (n - 1 - k) > (m - 1) + (n - m):
    p, q = m, n
else:
    p, q = (m * ((m - 1) + (n - m))), (n * (n - 1 - k))
g = gcd(p, q)
print(p // g, q // g)