/*

Author: Haze

2024/3/24

*/

#include <bits/stdc++.h>

#define irep(i, l, r) for(int i = (l); i <= (r); ++ i)
#define drep(i, r, l) for(int i = (r); i >= (l); -- i)
#define IOS ios::sync_with_stdio(false), cin.tie(nullptr);
using namespace std;
typedef long long ll;

inline ll read() {
    ll s = 0;
    bool fl = false;
    char ch = (char) getchar();
    while (!isdigit(ch)) {
        if (ch == '-')fl = true;
        ch = (char) getchar();
    }
    while (isdigit(ch)) {
        s = s * 10 + (ch ^ 48);
        ch = (char) getchar();
    }
    return fl ? -s : s;
}

const int mod = 1000000000 + 7;
const int itinf = 1000000999;
const ll llinf = 2e18;
const int N = 500099;

ll Abs(ll x){
    return x > 0 ? x : -x;
}

void solve() {
    ll n = read(), a = read(), b = read(), c = a * b;
    ll j = 1e7;
    ll res = llinf, x, y;
    for(ll i = 0; i <= n / a + 100; ++ i){
        while(j > 0 && n - (i * a + j * b) <= 0){
            -- j;
        }
        for(int j0 = max(j - 10, 0ll); j0 <= j + 10; ++ j0){
            if(Abs(i * a + j0 * b - n) <= res){
                x = i, y = j0;
                res = Abs(i * a + j0 * b - n);
            }
        }

    }
//    ll p = (n / c) * b;
//
//    ll res = llinf, x, y;
//    for(ll i = p; i <= p + 1000; ++ i){
//        for(ll j = 0; j <= 22000; ++ j){
//
//        }
//    }
    cout << x << ' ' << y;
////    cerr << res;
}

int main() {
    // IOS
    int T = 1;
    while (T--) {
        solve();
    }
    return 0;
}
/*
2214408
11299
197
 */