#include <cstdio>
#include <algorithm>
#include <cstring>
using namespace std;
typedef long long L;

L a, b, c, ta, tb, lcm, ansa, ansb, mn, mx, ans;

L gcd(L x, L y) {return y ? gcd(y, x%y) : x;}

int main()
{
	freopen("BlackHawk.in", "r", stdin);
	freopen("BlackHawk.out", "w", stdout);
	
	scanf("%lld %lld %lld", &a, &b, &c);
	if(a > b) swap(a, b);
	lcm = a/gcd(a, b)*b;
	ta = lcm/a, tb = lcm/b;
	
	ansb = c/b;
	while((c-ansb*b) % a && ansb >= 0) ansb--;
	if(ansb < 0) {puts("-1 -1"); puts("0"); return 0;}
	ansa = (c-ansb*b)/a;
	
	ans = ansb / tb;
	mn = ansa + ansb;
	mx = mn - tb*ans + ta*ans;
	
	printf("%lld %lld\n%lld", mn, mx, ans+1);
	return 0;
}