Problem

There are m jobs that need to be scheduled on n processors. A schedule is considered balanced if the difference in the number of jobs between any two neighboring processors does not exceed 1.

The $k^{th}$ processor is the most efficient, so it should be assigned the maximum number of jobs possible while keeping the schedule balanced. Determine the maximum number of jobs that can be assigned to the $k^{th}$ processor under these conditions.

Note: Every processor must have at least one job.

Input

• n: the number of processors
• m: the number of jobs
• k: the 1-based index of the most efficient processor

Output

• The maximum number of jobs that can be scheduled on the $k^{th}$ processor maintaining a balanced schedule