#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (int)n; i++)
using ll = long long;

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

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