8587: Fraction Game

NIO is playing a novel fraction game. The interface is shaped like an isosceles triangle of size $n$. In each grid there is a fractional number. Every round, an isosceles upward triangle area of size $k$ is activated to click. And when the round is finished and a new round begins, a new area of a triangle is able to click, and the old area is locked, except the overlap region. For each triangle, NIO can click on a grid, and the fractional number inside this grid will be added to his score. If NIO clicks on a grid slowly, then he will get no score to add. If all possible upward triangles with size k on the interface can be clicked during the game time. What is the maximum score NIO will get ideally? Size $n$ means that in the $i$-th line there are i triangles.

For each test case, the first line contains two numbers, n denotes the height of the game interface and $k$ (1≤k≤n≤1000) denotes the size of the upward triangle that each round NIO can operate.

Output the reduction of a fraction, representing the maximum score NIO will get. For example, "4/12" can be reduced to "1/3".

The test data is guaranteed not to exceed long long during the operation. If the result is "3/1", output "3/1" directly.