Minimize Groups

You are given three integers n, a, and b where n is the total number of attendees and each group must have at least a and at most b members. To minimize the number of groups, you should aim to use as many members per group as possible, i.e. form groups of size b.

The answer can be computed using the formula: \( \lceil n / b \rceil \), which represents the smallest integer greater than or equal to \( n / b \).

For example, if there are 15 attendees and groups can have at most 5 members, then the minimum number of groups is \( \lceil 15 / 5 \rceil = 3 \).

inputFormat

The input consists of a single line containing three space-separated integers n, a, and b.

It is guaranteed that n is the total number of attendees, and a and b represent the minimum and maximum allowed group sizes, respectively.

outputFormat

Output a single integer, which is the minimum number of groups needed under the constraint that each group has at most b members. (Note that to minimize groups, each group should ideally use the maximum allowed size b.)

15 4 5

3