#include <iostream>
#include <cstdio>
#include <iomanip>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <stack>
#include <utility>
#include <numeric>
#include <algorithm>
#include <functional>
#include <cctype>
#include <complex>
#include <string>
#include <sstream>
#include <fstream>
#include <cassert>
using namespace std;

//common
typedef int  i32;
typedef long long i64,ll;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii;
typedef long long ll; typedef vector<long long> vl; typedef pair<long long,long long> pll; typedef vector<pair<long long,long long> > vpll;
typedef vector<string> vs; typedef long double ld;

#define BR "\n"
#define ALL(c) (c).begin(),(c).end()
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define EACH(it,o) for(auto it = (o).begin(); it != (o).end(); ++it)
#define IN(l,v,r) ((l)<=(v) && (v)<(r))

//config
//#define NDEBUG
//#define INF 1<<30
//#define EPS 1e-8
//const ll MOD =100000007;

//debug
#ifdef NDEBUG
#define DUMP(x)
#define DUMPLN(x)
#define DEBUG(x)
#define DEBUGLN(x)
#define LINE()
#define LINELN()
#define CHECK(exp,act)
#define STOP(e)
#else
#define DUMP(x)  cerr << #x << " = " << (x)
#define DUMPLN(x)  DUMP(x) <<endl
#define DEBUG(x) DUMP(x) << LINE() << " " << __FILE__
#define DEBUGLN(x) DEBUG(x)<<endl
#define LINE()    cerr<< " (L" << __LINE__ << ")"
#define LINELN()    LINE()<<endl
#define CHECK(exp,act)  if(exp!=act){DUMPLN(exp);DEBUGLN(act);}
#define STOP(e)  CHECK(e,true);if(!(e)) exit(1);
#endif

template<class T> inline string toString(const vector<T>& x) {
	stringstream ss;
	REP(i,x.size()){
		if(i!=0)ss<<" ";
		ss<< x[i];
	}
	return ss.str();
}

template<class T> inline string toString(const vector<vector<T> >& map) {
	stringstream ss;
	REP(i,map.size()){
		if(i!=0)ss<<BR;
		ss<< toString(map[i]);
	}
	return ss.str();
}
template<class K,class V>  string toString(map<K,V>& x) {
	string res;stringstream ss;
	for(auto& p:x)ss<< p.first<<":" << p.second<<" ";
	return ss.str();
}

string BITtoString(int bit){
    stringstream ss;
    while(bit!=0){ss<<(bit%2);bit/=2;}
    string res=ss.str();reverse(ALL(res));
    return res;
}

template<typename T,typename V> inline T mod(T v,V MOD){
	return (v%MOD+MOD)%MOD;
}

namespace Number{
	const int MOD= 10000007;
	
	typedef ll T;
	//O(log(a,b))
	T gcd(T a,T b){return b==0 ? a : gcd(b,a%b);}
	T lcm(T a,T b){return a*b/gcd(a,b);}

	//ax+by=gcd(a,b)の解 x,y
	pair<T,T> extgcd(T a,T b){
		if(b==0)return make_pair(1,0);
		pair<T,T> res=extgcd(b,a%b);
		return make_pair(res.second,res.first-a/b*res.second);
	}
}
using namespace Number;

ll INF=1LL<<58;
class Main{
public:
	void run(){
	//	ifstream cin("in");
	//	ofstream cout( "out" );
		while(true){
			int a,b,d;cin >> a >> b >> d;
			if(d==0)break;
			int g=gcd(a,b);
			pair<int,int> s=extgcd(a,b);
			ll xs=s.first*(d/g),ys=s.second*(d/g);
			ll xt=b/g,yt=-a/g;
			
			int resx=-1,resy=-1;
			ll c=INF;
			int weight=INF;
			for(int t=-50000;t<=50000;t++){
				ll x=xs+xt*t,y=ys+yt*t;
				if(c>abs(x)+abs(y)){
					c=abs(x)+abs(y);
					weight=a*abs(x)+b*abs(y);
					resx=x;resy=y;
				}else if(weight>a*abs(x)+b*abs(y)){
					weight=a*abs(x)+b*abs(y);
					resx=x;resy=y;		
				}
			}
			cout <<abs(resx) <<" "<< abs(resy)<<endl;
		}

	}
};
 int main(){
ios::sync_with_stdio(false);
 	Main().run();
 	return 0;
 }

Measured memory_bytes: 1192