#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;


pair<int,int> solve2(int a,int b,int d)
{
  bool swapped=false;
  if (a<b){
    swap(a,b);
    swapped=true;
  }
  
  int acnt=d/a;
  while(((d-(acnt*a))%b)!=0){
    acnt--;
  }
  int bcnt=(d-(acnt*a))/b;

  if (acnt<0) return  make_pair(999999999,99999999);
  if (swapped) return make_pair(bcnt,acnt);
  else return make_pair(acnt,bcnt);
}

pair<int,int> solve(int a,int b,int d)
{
  /*
  int md=d%a;
  int fd=a-md;
  int mb=b%a;
  */
  int aa=0;
  int bb=d;
  int acnt=0,bcnt=0;

  while(aa!=bb){
    if (aa<bb){
      acnt++;
      aa+=a;
    }
    else{
      bcnt++;
      bb+=b;
    }
  }
  return make_pair(acnt,bcnt);
}

bool cmp(pair<int,int> &ka,pair<int,int> &kb,int a,int b)
{
  int ca=ka.first+ka.second;
  int cb=kb.first+kb.second;
  
  int cca=a*ka.first+b*ka.second;
  int ccb=a*kb.first+b*kb.second;
  
  return (ca<cb||(ca==cb&&cca<ccb));
}

int main()
{
  ifstream cin("A.txt");

  int a,b,d;
  while(cin>>a>>b>>d,(a|b|d)!=0){
    pair<int,int> ka=solve(a,b,d);
    pair<int,int> kb=solve(b,a,d);
    pair<int,int> kc=solve2(a,b,d);
    swap(kb.first,kb.second);

    if (cmp(ka,kb,a,b)&&cmp(ka,kc,a,b))
      cout<<ka.first<<" "<<ka.second<<endl;
    else if (cmp(kb,kc,a,b))
      cout<<kb.first<<" "<<kb.second<<endl;
    else
      cout<<kc.first<<" "<<kc.second<<endl;
  }
  return 0;
}