Fill Candies

Chef received $N$ candies on his birthday. He wants to put these candies in some bags. A bag has $K$ pockets and each pocket can hold at most $M$ candies. Find the **minimum** number of bags Chef needs so that he can put every candy into a bag. ### Input - The first line of input will contain a single integer $T$, denoting the number of test cases. - Each test case consists of a single line conta