Minimum Days to Meet Production Target

You are given a production target D and a daily production rate P. Your task is to determine the minimum number of days required to produce at least D items. In other words, find the smallest integer N such that:

\( N \times P \ge D \)

This problem is equivalent to computing the ceiling of \(\frac{D}{P}\). To achieve the same result using integer arithmetic, you may use the formula:

\( N = \frac{D + P - 1}{P} \)

Process multiple test cases as specified in the input.

inputFormat

The first line contains an integer T (the number of test cases). Each of the following T lines contains two space-separated integers D and P, where D is the production target and P is the production per day.

outputFormat

For each test case, output a single line containing the minimum number of days required to meet or exceed the production target.

## sample

3
20 50
10 200
30 90

1
1
1

</p>