#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
#include <set>
#include <queue>
#include <iomanip>
#include <cstring>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i,n) for (int i = 0; i < int(n);i++)
using mint = modint1000000007;

ll gcd(ll a,ll b){return b ? gcd(b,a%b): a;}

int main(){
  ll n,m,k;
  cin >> n >> m >> k;
  ll up = m*(n-1);
  ll down = n*(n-k-1);
  ll g = gcd(up,down);
  cout << up/g << " " << down/g << endl; 
  
  return 0;
}