#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>
#include <numeric>
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
//constexpr long long MAX = 5100000;
constexpr long long INF = 1LL << 60;
constexpr int inf = 1000000007;
constexpr long long mod = 1000000007LL;
//constexpr long long mod = 998244353LL;
const long double PI = acos((long double)(-1));

using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;

void solve() {
    ll x, y, z; scanf("%lld %lld %lld", &x, &y, &z); if (x == 0 and y == 0 and z == 0) exit(0);
    ll a = INF, b = INF;
    for (ll i = 0; i <= 500000; i++) {
        {
            ll t = x * i;
            if (llabs(z - t) % y == 0) {
                ll j = llabs(z - t) / y;
                if (i + j < a + b or (i + j == a + b and i * x + j * y < a * x + b * y)) {
                    a = i, b = j;
                }
            }
        }
        {
            ll t = x * i;
            if (llabs(-z - t) % y != 0) continue;
            ll j = llabs(-z - t) / y;
            if (i + j < a + b or (i + j == a + b and i * x + j * y < a * x + b * y)) {
                a = i, b = j;
            }
        }
    }
    printf("%lld %lld\n", a, b);
}

int main()
{
    /*
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    */
    int kkt = 89;
    while (kkt) {
        solve();
    }
    return 0;
}
