No tag edit access

B. Nearest Fraction

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputYou are given three positive integers *x*, *y*, *n*. Your task is to find the nearest fraction to fraction whose denominator is no more than *n*.

Formally, you should find such pair of integers *a*, *b* (1 ≤ *b* ≤ *n*; 0 ≤ *a*) that the value is as minimal as possible.

If there are multiple "nearest" fractions, choose the one with the minimum denominator. If there are multiple "nearest" fractions with the minimum denominator, choose the one with the minimum numerator.

Input

A single line contains three integers *x*, *y*, *n* (1 ≤ *x*, *y*, *n* ≤ 10^{5}).

Output

Print the required fraction in the format "*a*/*b*" (without quotes).

Examples

Input

3 7 6

Output

2/5

Input

7 2 4

Output

7/2

Codeforces (c) Copyright 2010-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/21/2018 06:22:03 (d1).

Desktop version, switch to mobile version.

User lists

Name |
---|