#include <stdio.h>
#define Max 100001
int prime[Max];
void pre()
{
	int i, j;
	memset(prime, -1, sizeof(prime));

	for (i = 2; i * i < Max; i++)
	{
		if (prime[i] == 0)
		{
			continue;
		}
		for (j = 2; j * i < Max; j++)
		{
			prime[i * j] = 0;
		}
	}
}

int main()
{
	int m, a, b, c, d, max, i, j, tmp;
	pre();
	while (scanf("%d %d %d", &m, &a, &b) != -1 && (m + a + b))
	{
		max = 0;
		c = 0;
		d = 0;
		
		for (i = (int)sqrt(m); i > 1; i--)
		{
			if (prime[i] == 0)
			{
				continue;
			}
			j = m / i;
			if (j > b * i / a)
			{
				j = b * i / a;
			}
			for (; j >= i && i * j > max; j--)
			{
				if (prime[j])
				{
					tmp = i * j;
					if (max < tmp)
					{
						max = tmp;
						c = i;
						d = j;
					}
				}
			}
		}
		printf("%d %d\n", c, d);
	}
	return 0;
}