Drink
Very easy
Execution time limit is 1 second
Runtime memory usage limit is 128 megabytes
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 ().
Output
Print the maximum number of bottles that Kozak Us can buy.
Examples
Input #1
Answer #1
Input #2
Answer #2
Input #3
Answer #3
Submissions 1K
Acceptance rate 56%