#include <iostream>
#include <algorithm> // for sort, mainly
#include <vector>
#include <map>
#include <set>
#include <cmath>
#include <array>
#include <string>
#include <cstdio>
#include <iterator>
#include <unordered_set>
#include <cstdint> // for int64_t, int32_t, etc
#include <queue>
#include <stack>
#include <deque>
#include <numeric> // gcd, lcm
#include <fstream>
#include <bitset> // for bitset
#include <iomanip>
#include <cassert> // for set with custom ordering
#include <type_traits> // for set with custom ordering
#include <utility> // for swap, forward, etc
using namespace std;

#pragma GCC optimize("O2")
// #pragma GCC optimize("O1","O2","O3","Ofast","unroll-loops")
// #pragma GCC target("sse","sse2","sse3","sse4.1","sse4.2","avx","avx2","fma")

template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
void dbg_out() { cout << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cout << ' ' << H; dbg_out(T...); }
#ifdef LOCAL
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif

/*

notes:

int64_t
stoi(string s) -> string to int
to_string() -> int (or else) to string

vector declaration:
vector<ll> v(n, 0)
vector<vector<ll>> v(n, vector<ll>(n, 0));

{if statement} ? {truth value} : {false value}

#ifdef LOCAL
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
#endif

std::lcm(ll a, ll b), std::gcd(int a, int b)

cout << fixed << setprecision(n);

set with custom ordering
set<ll, decltype(&cmp)> qu(cmp);

*/

typedef int64_t ll;

ll extendedeuclid(ll a, ll b, ll &x, ll &y) {

	if(b == 0) {
		x = 1;
		y = 0;
		return a;
	}

	ll x1, y1;
	ll d = extendedeuclid(b, a % b, x1, y1);
	x = y1;
	y = x1 - y1 * (a / b);
	return d;
}	

void solve() {

	ll h, a, b;
	cin >> h >> a >> b;

	// a * x + b * y = c
	// oldest problem in the book
	// and I'm still shit at it but let's not get so hasty

	// szoval
	// standard extended euclidean algorithm megoldja a * x + b * y = gcd(x, y)
	// es erre ad egy a, b erteket
	// ha c mod gcd = 0, akkor egyszeruen vesszik c / g es beszorozzuk vele az x/y-t

	ll g = gcd(a, b);
	if(h % g != 0) {
		cout << "0 0";
		return;
	}

	ll x0, y0;
	extendedeuclid(a, b, x0, y0);
	x0 *= h / g;
	y0 *= h / g;

	if(x0 >= 0 && y0 >= 0) {
		cout << x0 << " " << y0;
		return;
	}

	// x = x0 + k * (b/g)
	// y = y0 - k * (a/g)

	if(x0 < 0 && y0 >= 0) {

		// tehat maximalisan noveljuk az x-et
		// vagyis y-t a leheto legkisebbig levisszuk
		//  y = y0 - k * (a/g)
		// y0 = k * (a/g)
		// k = (y0) / (a/g)

		ll k = y0 / (a/g);

		ll x = x0 + k * (b/g);
		ll y = y0 - k * (a/g);

		cout << x << " " << y;
		return;
	}

	if(x0 >= 0 && y0 < 0) {

		// x = x0 + k * (b/g)
		// x0 = -k * (b/g)
		// k = -x0 / (b/g)

		ll k = -x0 / (b/g);

		ll x = x0 + k * (b/g);
		ll y = y0 - k * (a/g);

		cout << x << " " << y;

	}
}

int main()
{
	std::ios_base::sync_with_stdio(false);
	//cin.tie(nullptr);
	//cout.tie(nullptr);

	solve();

	return 0;
}