Loading [MathJax]/jax/output/HTML-CSS/fonts/TeX/fontdata.js

B. ICPC Square
time limit per test
1 second
memory limit per test
1024 megabytes
input
standard input
output
standard output

ICPC Square is a hotel provided by the ICPC Committee for the accommodation of the participants. It consists of N floors (numbered from 1 to N). This hotel has a very unique elevator. If a person is currently at floor x, by riding the elevator once, they can go to floor y if and only if y is a multiple of x and yxD.

You are currently at floor S. You want to go to the highest possible floor by riding the elevator zero or more times. Determine the highest floor you can reach.

Input

A single line consisting of three integers N D S (2N1012;1DN1;1SN).

Output

Output a single integer representing the highest floor you can reach by riding the elevator zero or more times.

Examples
Input
64 35 3
Output
60
Input
2024 2023 1273
Output
1273
Note

Explanation for the sample input/output #1

First, ride the elevator from floor 3 to floor 15. This is possible because 15 is a multiple of 3 and 15335. Then, ride the elevator from floor 15 to floor 30. This is possible because 30 is a multiple of 15 and 301535. Finally, ride the elevator from floor 30 to floor 60. This is possible because 60 is a multiple of 30 and 603035.