1 /*Author:WNJXYK*/
2 #include<cstdio>
3 using namespace std;
4 int n,m;
5 long double tmp;
6 int ansb,ansa;
7 long double delta=1e30;
8 inline long double abs(long double x){
9 if (x<0) return -x;
10 return x;
11 }
12 int main(){
13 scanf("%d%d",&n,&m);
14 tmp=(long double)n/(long double)m;
15 for (int b=1;b<=32767;b++){
16 int fz=((long double)n/(long double)m*(long double)b);
17 if (abs((long double)(fz-1)/(long double)b-(long double)n/(long double)m)<delta && (fz-1)*m!=n*b){
18 delta=abs((long double)(fz-1)/(long double)b-(long double)n/(long double)m);
19 ansa=fz-1;
20 ansb=b;
21 }
22 if (abs((long double)(fz)/(long double)b-(long double)n/(long double)m)<delta && fz*m!=n*b){
23 delta=abs((long double)(fz)/(long double)b-(long double)n/(long double)m);
24 ansa=fz;
25 ansb=b;
26 }
27 if (abs((long double)(fz+1)/(long double)b-(long double)n/(long double)m)<delta && (1+fz)*m!=n*b){
28 delta=abs((long double)(fz+1)/(long double)b-(long double)n/(long double)m);
29 ansa=fz+1;
30 ansb=b;
31 }
32 }
33 printf("%d %d\n",ansa,ansb);
34 return 0;
35 }