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 a hryvnia. Kozak Us has exactly b 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 c bottles.
Find the maximum number of bottles that Kozak Us can buy.
One line contains three integers a, b and c (1≤a,b,c≤100).
Print the maximum number of bottles that Kozak Us can buy.