#include "bits/stdc++.h"
#pragma GCC optimize("Ofast")

// Begin Header {{{
using namespace std;

#ifndef DEBUG
#define dump(...)
#endif

#define all(x) x.begin(), x.end()
#define rep(i, b, e) for (intmax_t i = (b), i##_limit = (e); i < i##_limit; ++i)
#define reps(i, b, e) for (intmax_t i = (b), i##_limit = (e); i <= i##_limit; ++i)
#define repr(i, b, e) for (intmax_t i = (b), i##_limit = (e); i >= i##_limit; --i)
#define var(Type, ...) Type __VA_ARGS__; input(__VA_ARGS__)

constexpr size_t    operator""_zu(unsigned long long value) { return value; };
constexpr intmax_t  operator""_jd(unsigned long long value) { return value; };
constexpr uintmax_t operator""_ju(unsigned long long value) { return value; };

constexpr int INF = 0x3f3f3f3f;
constexpr intmax_t LINF = 0x3f3f3f3f3f3f3f3f_jd;

template <class T, class Compare = less<>>
using MaxHeap = priority_queue<T, vector<T>, Compare>;
template <class T, class Compare = greater<>>
using MinHeap = priority_queue<T, vector<T>, Compare>;

inline void input() {}
template <class Head, class... Tail>
inline void input(Head&& head, Tail&&... tail) {
    cin >> head;
    input(forward<Tail>(tail)...);
}

template <class T>
inline istream& operator>>(istream &is, vector<T> &vec) {
    for (auto &e: vec) {
        is >> e;
    }
    return is;
}

inline void output() { cout << "\n"; }
template <class Head, class... Tail>
inline void output(Head&& head, Tail&&... tail) {
    cout << head;
    if (sizeof...(tail)) {
        cout << " ";
    }
    output(forward<Tail>(tail)...);
}

template <class T>
inline ostream& operator<<(ostream &os, const vector<T> &vec) {
    static constexpr const char *delim[] = {" ", ""};
    for (const auto &e: vec) {
        os << e << delim[&e == &vec.back()];
    }
    return os;
}

template <class T>
inline vector<T> makeVector(const T &initValue, size_t sz) {
    return vector<T>(sz, initValue);
}

template <class T, class... Args>
inline auto makeVector(const T &initValue, size_t sz, Args... args) {
    return vector<decltype(makeVector<T>(initValue, args...))>(sz, makeVector<T>(initValue, args...));
}

template <class Func>
class FixPoint : Func {
public:
    explicit constexpr FixPoint(Func&& f) noexcept : Func(forward<Func>(f)) {}

    template <class... Args>
    constexpr decltype(auto) operator()(Args&&... args) const {
        return Func::operator()(*this, std::forward<Args>(args)...);
    }
};

template <class Func>
static inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept {
    return FixPoint<Func>{forward<Func>(f)};
}

template <class Container>
struct reverse_t {
    Container &c;
    reverse_t(Container &c) : c(c) {}
    auto begin() { return c.rbegin(); }
    auto end() { return c.rend(); }
};

template <class Container>
auto reversed(Container &c) {
    return reverse_t<Container>(c);
}

template <class T>
inline bool chmax(T &a, const T &b) noexcept {
    return b > a && (a = b, true);
}

template <class T>
inline bool chmin(T &a, const T &b) noexcept {
    return b < a && (a = b, true);
}

template <class T>
inline T diff(const T &a, const T &b) noexcept {
    return a < b ? b - a : a - b;
}
// End Header }}}

// Fraction {{{
class Fraction {
private:
    constexpr static inline intmax_t gcd(intmax_t a, intmax_t b) {
        return b == 0 ? abs(a) : gcd(b, a % b);
    }

public:
    intmax_t numerator, denominator;

    Fraction() {
        numerator = 0;
        denominator = 1;
    }

    Fraction(intmax_t n, intmax_t d) {
        if (n == 0) {
            numerator = 0;
            denominator = 1;
        } else {
            int sign = ((n < 0) == (d < 0) ? 1 : -1);
            n = abs(n), d = abs(d);

            intmax_t g = gcd(n, d);
            numerator = sign * n / g;
            denominator = d / g;
        }
    }

    operator intmax_t() { return numerator / denominator; }
    operator double() { return (double) numerator / denominator; }
};

Fraction operator+(const Fraction &lhs, const Fraction &rhs) {
    Fraction ret
        (lhs.numerator * rhs.denominator + rhs.numerator * lhs.denominator,
         lhs.denominator * rhs.denominator
        );
    return ret;
}

Fraction operator+=(Fraction &lhs, const Fraction &rhs) {
    Fraction ret
        (lhs.numerator * rhs.denominator + rhs.numerator * lhs.denominator,
         lhs.denominator * rhs.denominator
        );
    lhs = ret;
    return lhs;
}

Fraction operator-(const Fraction &lhs, const Fraction &rhs) {
    Fraction ret
        (lhs.numerator * rhs.denominator - rhs.numerator * lhs.denominator,
         lhs.denominator * rhs.denominator
        );
    return ret;
}

Fraction operator-=(Fraction &lhs, const Fraction &rhs) {
    Fraction ret
        (lhs.numerator * rhs.denominator - rhs.numerator * lhs.denominator,
         lhs.denominator * rhs.denominator
        );
    lhs = ret;
    return lhs;
}

Fraction operator*(const Fraction &lhs, const Fraction &rhs) {
    Fraction ret
        (lhs.numerator * rhs.numerator,
         lhs.denominator * rhs.denominator
        );
    return ret;
}

Fraction operator*=(Fraction &lhs, const Fraction &rhs) {
    Fraction ret
        (lhs.numerator * rhs.numerator,
         lhs.denominator * rhs.denominator
        );
    lhs = ret;
    return lhs;
}

Fraction operator/(const Fraction &lhs, const Fraction &rhs) {
    Fraction ret
        (lhs.numerator * rhs.denominator,
         lhs.denominator * rhs.numerator
        );
    return ret;
}

Fraction operator/=(Fraction &lhs, const Fraction &rhs) {
    Fraction ret
        (lhs.numerator * rhs.denominator,
         lhs.denominator * rhs.numerator
        );
    lhs = ret;
    return lhs;
}

bool operator<(const Fraction &lhs, const Fraction &rhs) {
    const intmax_t lhs_numerator = lhs.numerator * rhs.denominator;
    const intmax_t rhs_numerator = rhs.numerator * lhs.denominator;
    return lhs_numerator < rhs_numerator;
}

bool operator>(const Fraction &lhs, const Fraction &rhs) { return rhs < lhs; }

bool operator<=(const Fraction &lhs, const Fraction &rhs) { return !(lhs > rhs); }

bool operator>=(const Fraction &lhs, const Fraction &rhs) { return !(lhs < rhs); }

bool operator==(const Fraction &lhs, const Fraction &rhs) { return !(lhs < rhs) && !(lhs > rhs); }

bool operator!=(const Fraction &lhs, const Fraction &rhs) { return (lhs < rhs) || (lhs > rhs); }

ostream& operator<<(ostream &os, const Fraction &a) {
    // if (a.denominator == 1) {
    //     os << a.numerator;
    // } else {
    //     os << a.numerator << '/' << a.denominator;
    // }
    os << a.numerator << '/' << a.denominator;
    return os;
}
// }}}

Fraction L, R;

void SternBrocot(intmax_t p, intmax_t n, Fraction l = Fraction(0, 1), Fraction r = Fraction(1, 0)) {
    Fraction mediant(l.numerator + r.numerator, l.denominator + r.denominator);
    const intmax_t mn = mediant.numerator;
    const intmax_t md = mediant.denominator;

    if (mn > n || md > n) return;

    if (p * md * md < mn * mn) {
        R = mediant;
        SternBrocot(p, n, l, mediant);
    } else if (p * md * md > mn * mn) {
        L = mediant;
        SternBrocot(p, n, mediant, r);
    } else {
        L = R = mediant;
    }
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.setf(ios_base::fixed);
    cout.precision(10);
    intmax_t p, n;
    while (cin >> p >> n) {
        if (!p && !n) break;
        SternBrocot(p, n);
        output(R, L);
    }
    return 0;
}



Measured memory_bytes: 3144