Strange Optimization

题号：NC52868
时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 32 M，其他语言64 M
Special Judge, 64bit IO Format: %lld

题目描述

Bobo is facing a strange optimization problem.
Given n, m, he is going to find a real number $\alpha$ such that $f(\frac{1}{2} + \alpha)$ is maximized, where $f(t) = \min_{i, j \in \mathbb{Z}} |\frac{i}{n} - \frac{j}{m} + t|$ .
Help him!
Note: It can be proved that the result is always rational.

输入描述:

The input contains zero or more test cases and is terminated by end-of-file. 
Each test case contains two integers n, m.
* 
* The number of tests cases does not exceed .

输出描述:

For each case, output a fraction p/q which denotes the result.

示例1

输入

复制

1 1
1 2

输出

复制

1/2
1/4

备注:

For the first sample,  maximizes the function.