/**
 * 
 */
package pandit.codejam;

import java.io.BufferedInputStream;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.Writer;
import java.util.Scanner;

/**
 * @author Manu Ram Pandit
 * 
 */
public class DancingWithGooglersUpload {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		FileInputStream fStream = new FileInputStream(
				"input.txt");

		Scanner scanner = new Scanner(new BufferedInputStream(fStream));
		Writer out = new OutputStreamWriter(new FileOutputStream("output.txt"));

		int T = scanner.nextInt();
		int N,S,P,ti;
		int counter = 0;
		for (int count = 1; count <= T; count++) {
			N=scanner.nextInt();
			S = scanner.nextInt();
			counter = 0;
			P = scanner.nextInt();
			for(int i=1;i<=N;i++){
				ti=scanner.nextInt();
				if(ti>=(3*P-2)){
					counter++;
					continue;
				}
				else if(S>0){
					if(P>=2 && ((ti==(3*P-3)) ||(ti==(3*P-4)))) {
					S--;
					counter++;
					continue;
					}
				}
				
			}
			// System.out.println("Case #" + count + ": " + counter);
			out.write("Case #" + count + ": " + counter + "\n");
		}
		fStream.close();
		out.close();

	}

}

import java.lang.*;
import java.util.*;
class dancer{
int count,s,p;
int doneS;
int can;
void Counts(int i1){
                    int thrice=3*p;
					if(i1>=thrice){count++;
								  can++;}
					else{int diff=(thrice-i1);
					    if(diff>4){can++;}
					     else if((diff==1)||(diff==2)){
						                             if(p==1){count++;
													          }
													if(p>=2){count++;
													       can++;}		  
												      }
						 else{
						      if(p>=2){count++;
						       doneS++;
							   }
							   }
                         }
						 
							   }}
//===========================
class p1{
public static void main(String args[]){
Scanner sc=new Scanner(System.in);
int n=sc.nextInt();
for(int i=0;i<n;i++){
dancer d1=new dancer();
int m=sc.nextInt();
d1.s=sc.nextInt();
d1.p=sc.nextInt();
for(int j=0;j<m;j++){
                      d1.Counts(sc.nextInt());  
   					   }
int sub=0;
if(d1.doneS==d1.s){}
else if(d1.doneS>d1.s){
                      sub=d1.doneS-d1.s;
					  }
else{sub=0;
	}					  
d1.count=d1.count-sub;;

System.out.println("Case #"+(i+1)+": "+d1.count);}
}}	