Minimum Buses Required

You are given t departments. For each department, there are two integers: the number of employees n and the maximum bus capacity k. Your task is to compute the minimum number of buses required so that all employees can be transported. The number of buses required is determined by the formula: \(\lceil \frac{n}{k} \rceil\), where \(\lceil x \rceil\) denotes the ceiling function of \(x\).

Note: Input is read from stdin and output is printed to stdout.

inputFormat

Input Format:
The first line contains an integer t, representing the number of departments. Each of the next t lines contains two space-separated integers n and k, where n is the number of employees and k is the maximum capacity of a bus.

outputFormat

Output Format:
Output a single line with t space-separated integers. Each integer represents the minimum number of buses required for the corresponding department.

3
10 4
15 5
7 2

3 3 4