#include<iostream>
#include<cstdio>
#include<queue>
#define int long long
using namespace std;
inline int read()
{
	int n=0,f=1,ch=getchar();
	while(ch<'0'||ch>'9')
	{
		if(ch=='-')f=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9')
	{
		n=n*10+ch-'0';
		ch=getchar();
	}
	return n*f;
}
int gcd(int x,int y)
{
	while(x^=y^=x^=y%=x);
	return y;
}
int jdz(int x)
{
	if(x<0)return -x;
	return x;
}
signed main()
{
	int n,m,c,sth,gc;
	n=read();
	m=read();
	c=read();
	int ansx=0,ansy=0,ansz=-1000000000;
	for(int i=0;i<=c+5;i++)
	{
		//if(i*m>n)break;
		sth=(n-i*m)/c;
		if(sth<0)sth=0;
		for(int j=max(sth-2,0LL);j<=sth+2;j++)
		{
			//printf("%lld %lld %lld\n",i,j,jdz(j*c+i*m-n));
			if(jdz(j*c+i*m-n)<jdz(ansz-n))
			{
				ansz=j*c+i*m;
				ansx=i;
				ansy=j;
			}
		}
	}
	printf("%lld %lld\n",ansx,ansy);
	return 0;
}