#include <cstdio>

 #include <cstring>

 #include <algorithm>

 #include <iostream>

 #include <cmath>

 using namespace std;

 typedef long long LL;

 template<class T> T sqr(T x) { return x * x;}

 template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a;}

 int main() {

     LL n, m;

     while (cin >> n >> m) {

         LL bx = , by = ;

 //        long double r = sqrt((long double) n);

 //        cout << r << endl;

         for (LL i = ; i <= m; i++) {

             LL t = (int) sqrt((double) sqr(i) * n);

             for (int d = ; d < ; d++) {

 //                if (fabs((long double) (t + d) / i - r) < fabs((long double) bx / by - r)) {

 //                    bx = t + d, by = i;

 //                }

                 if (abs(sqr(t + d) * sqr(by) - n * sqr(by) * sqr(i)) < abs(sqr(bx) * sqr(i) - n * sqr(by) * sqr(i))) bx = t + d, by = i;

             }

         }

         LL GCD = gcd(bx, by);

         cout << bx / GCD << "/" << by / GCD << endl;

     }

     return ;

 }