//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <climits>
#include <queue>

using namespace std;

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);

int main(){
  cin.tie(0);
  ios_base::sync_with_stdio(false);

  int a, b, d;
  while(cin>>a>>b>>d,a){
	// ax+by = d || |ax-by|=d
	// by=d-ax || by=ax-d, by=ax+d
	LL ans_x = 50001, ans_y = 50001;
	REP(x,50010){
	  LL y[] = {(d-a*x)/b, (a*x-d)/b, (d+a*x)/b};
	  REP(i,3){
		if((a*x+b*y[i] == d || abs(a*x-b*y[i]) == d) && y[i] >= 0)
		  if(ans_x+ans_y > x+y[i]
			 || (ans_x+ans_y == x+y[i] && a*ans_x+b*ans_y > a*x+b*y[i]))
			ans_x = x, ans_y = y[i];
	  }
	}
	cout << ans_x << " " << ans_y << endl;
  }
  
  return 0;
}