SP31557 HALCAND - Halum and Candies

Halum has been elected as the captain of his school's football team. To celebrate this, he is going to throw a party. Halum bought candies of **N** different flavors for the party. There are **a $ _{i} $** number of candies of the **i $ ^{th} $** flavor where **(1 . To satisfy a guest he has to give him/her some positive number of candies of at least **K** different flavors. Otherwise the guest is not satisfied. Given this information now you have to find the maximum number of guests Halum can satisfy with the available candies.**

First line of the input contains an integer **T (1 , denoting the number of test cases. **T** cases follow. First line of each case contains two integers **N** and **K** **(1 . **N** space separated integers **a $ _{1} $ , a $ _{2} $ … a $ _{N} $** follow in the next line **(0 . The **i $ ^{th} $** of these integers **a $ _{i} $** denotes the number of candies of **i $ ^{th} $** flavor **(1 .********

For each case print one line containing "**Case X: Y**" (without the quotes) where **X** is the case number starting from **1** and **Y** is an integer denoting the maximum number of guests who can be satisfied.