排水问题！

Drainage machines
Description
City R has flood every year. Now given a chorography of a place, consisted of n sections. Each section is described by height hiand its seeper’s horizontal height H. Thus, we need to put some drainage machines in proper sections to drain seeper. It is obviously that, when the seeper’s horizontal height is lower than the height of sections in where we put the drainage machines, we can’t drain the seeper out. We want to know at least how many drainage machines can make sure that every section’s seeper is drained (each drainage machine can be only put in one section).
Input
The first line of input contains T, the number of test cases. For each case, the first line of input contains an integer n (1 <= n <= 10^5).
The second line contains n integers hi(0 <= hi<= 10^6), denoting the height of n sections.
The third line contains an integer H (1 <= H <= 10^6), denoting the seeper’s horizontal height (H >= hi). The height of both ends can be considered as infinite.
Output
For each case, output a line containing “Case T:”, and the initial value of T is 1, then output a line containing the least number of drainage machines.