/* -*- coding: utf-8 -*-
 *
 * 1835.cc:  No.1835 Generalized Monty Hall Problem - yukicoder
 */

#include<cstdio>
#include<algorithm>
 
using namespace std;

/* constant */

/* typedef */

typedef long long ll;

/* global variables */

/* subroutines */

template <typename T>
T gcd(T m, T n) {  // m > 0, n > 0
  if (m < n) swap(m, n);
  while (n > 0) {
    T r = m % n;
    m = n;
    n = r;
  }
  return m;
}

/* main */

int main() {
  int n, m, k;
  scanf("%d%d%d", &n, &m, &k);

  /*
    1st time:
    m/n
    2ned time:
    (m/n)*(m-1)/(n-k-1)+((n-m)/n)*m/(n-k-1)
    = (m*(m-1)+(n-m)*m)/(n*(n-k-1))
    = m(n-1)/(n(n-k-1)) = (m/n)*((n-1)/(n-k-1))
  */

  ll p = (ll)m * (n - 1), q = (ll)n * (n - k - 1);
  ll g = gcd(p, q);
  p /= g, q /= g;

  printf("%lld %lld\n", p, q);
  return 0;
}