Qualification Round (Small)

You just advanced from the qualification round of a programming contest, and you want to know how many other contestants advanced with you. The only information you have is how many people solved each problem.

The qualification round had $P$ problems, and problem $i$ was fully solved by $S_i$ contestants. A contestant had to solve at least $C$ problems to advance. Using only that information, find the largest number of contestants who could have advanced.

No contestant solves the same problem twice, so solving $C$ problems means solving $C$ different problems.

The first line contains the number of test cases $T$. Each of the next $T$ lines holds one test case as space-separated integers: first $P$ and $C$, then the $P$ integers $S_0, S_1, \dots, S_{P-1}$.

Limits

• $1 \le T \le 100$
• $1 \le P \le 6$
• $1 \le C \le P$
• $0 \le S_i \le 1000$

For each test case, print one line in the form Case #x: y, where $x$ is the test case number starting from 1 and $y$ is the largest number of contestants who could have solved at least $C$ problems.