Maximum Complete Hikes

Bob loves hiking and wants to plan his trips carefully. Given two integers (S) and (D) for each test case, where (S) is the total distance available and (D) is the distance required for one complete hike, determine the maximum number of complete hikes Bob can perform. In other words, compute (\lfloor \frac{S}{D} \rfloor) for each test case.

For example, if (S = 50) and (D = 10), then Bob can complete 5 hikes.

inputFormat

The input is read from standard input.

The first line contains a single integer (T) representing the number of test cases. Each of the next (T) lines contains two space-separated integers (S) and (D), where (S) is the total distance and (D) is the distance required for one complete hike.

outputFormat

For each test case, output one integer on a new line representing the maximum number of complete hikes Bob can perform (i.e. (\lfloor \frac{S}{D} \rfloor)).## sample

5
50 10
20 5
15 7
30 15
25 8

5
4
2
2
3