Even File Distribution

You are given two integers m and n where m represents the number of servers and n represents the number of files. The task is to determine the minimum possible value for the maximum number of files that any single server holds when the files are distributed as evenly as possible.

Mathematically, if the files are distributed optimally, the maximum number of files on any server will be given by the ceiling of the fraction:

$$\lceil \frac{n}{m} \rceil$$

Note that if there are more servers than files, each server will hold at most one file.

inputFormat

The input consists of a single line containing two space-separated integers m and n, where:

• m is the number of servers.
• n is the number of files.

You may assume that m and n are positive integers.

outputFormat

Output a single integer representing the minimum possible maximum number of files any server holds after optimally distributing the files.

3 5

2