Drink#10751

Drink

1 second
128 megabytes
Very easy

Kozak Us saw his favorite drink in the vending machine (we would have entered its name, but we were not paid for it). It is known that one bottle costs exactly hryvnia. Kozak Us has exactly hryvnia, and he is ready to spend all of them in order to buy as much of his favorite drink as possible. However, the vending machine only has bottles.

Find the maximum number of bottles that Kozak Us can buy.

Input

One line contains three integers , and (1 \leq a, b, c \leq 100).

Output

Print the maximum number of bottles that Kozak Us can buy.

Examples

Example 1

Loading
Loading

Example 2

Loading
Loading

Example 3

Loading
Loading