Covering an equilateral triangle

Jieun likes to cover things. This time she wants to cover an equilateral triangle with side length $A$ completely, using equilateral triangles with side length $B$.

You are given two integers $A$ and $B$. Here $B \le A$ and $A$ is divisible by $B$. Find the minimum number of triangles with side length $B$ that are needed to cover the triangle with side length $A$ completely.

The first line contains the number of test cases $T$. ($1 \le T \le 1000$)

Each of the next $T$ lines contains two integers $A$ and $B$ separated by a space. ($1 \le B \le A \le 10^6$, and $A$ is divisible by $B$.)

For each test case, print on its own line the minimum number of triangles with side length $B$ that are needed to cover the triangle with side length $A$ completely.