## Problem J. Integer approximation ≡

• problems
 Author: Far-Eastern Subregional Time limit: 1 sec Input file: input.txt Memory limit: 8 Mb Output file: output.txt

### Statement

The FORTH programming language does not support floating-point arithmetic at all. Its author, Chuck Moore, maintains that floating-point calculations are too slow and most of the time can be emulated by integers with proper scaling. For example, to calculate the area of the circle with the radius R he suggests to use formula like R * R * 355 / 113, which is in fact surprisingly accurate. The value of 355 / 113 = 3.14159... is approximating the value of &pi; with the absolute error of only about 10-7. You are to find the best integer approximation of a given floating-point number A within a given integer limit L. That is, to find such two integers N and D (1 &le; N, D &le; L) that the value of absolute error |A - N / D| is minimal.

### Input file format

The first line of input file contains a floating-point number A with the precision of up to 15 decimal digits. The second line contains the integer limit L.

### Output file format

Output file must contain two integers, N and D, separated by space.

### Constraints

0.1 &le; A &lt; 10, 1 &le; L &le; 100000

### Sample tests

No. Input file (input.txt) Output file (output.txt)
1
3.14159265358979
10000

355 113

0.073s 0.010s 13