Cookie Lover

Cheolsu likes cookies more than anything else. Wherever there are cookies, Cheolsu is there too. Every day he eats $C$ of the cookies he holds. If fewer than $C$ cookies are left, he eats all of them. Given that Cheolsu holds $N$ cookies, find how many days he eats cookies for.

The first line contains the number of test cases $T$. Each of the next $T$ lines contains one test case: the number of cookies $N$ that Cheolsu holds and the number of cookies $C$ he eats each day, separated by a space.

For each test case, print on its own line how many days Cheolsu eats cookies for.

• $0 < T < 100$
• $0 < N < 1{,}000{,}000{,}000$
• $0 < C < 5{,}000$