#C1351. Maximum Complete Teams

    ID: 43056 Type: Default 1000ms 256MiB

Maximum Complete Teams

Maximum Complete Teams

You are given T test cases. For each test case, two integers N and K are provided. Here, N denotes the total number of t-shirts available and K denotes the number of t-shirts required to form one complete team. Your task is to determine the maximum number of complete teams that can be formed.

Mathematically, for each test case, calculate the value \(\lfloor \frac{N}{K} \rfloor\), where \(\lfloor \cdot \rfloor\) represents the floor function.

inputFormat

The first line of input contains a single integer T, the number of test cases. Each of the next T lines contains two space-separated integers N and K.

outputFormat

For each test case, output a single line containing the maximum number of complete teams that can be formed.

## sample
1
10 3
3

</p>