Complete Groups Formation

You are given a number of test cases. For each test case, you are provided with two integers \(N\) and \(K\), where \(N\) represents the number of employees and \(K\) represents the size of a complete group. Your task is to determine how many complete groups can be formed from \(N\) employees, i.e. compute \(\left\lfloor\frac{N}{K}\right\rfloor\).

For example, if \(N = 8\) and \(K = 3\), the number of complete groups is \(\lfloor 8/3 \rfloor = 2\). Similarly, when \(N = 10\) and \(K = 1\), the answer is 10.

inputFormat

The input is read from standard input (stdin) and has the following format:

1. The first line contains a single integer \(T\), the number of test cases.
2. Each of the following \(T\) lines contains two space-separated integers \(N\) (the number of employees) and \(K\) (the size of a complete group).

outputFormat

For each test case, output a single line containing the number of complete groups that can be formed (i.e., \(\lfloor N/K \rfloor\)).

## sample

3
8 3
10 1
7 5

2
10
1

</p>