import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class DancingWithTheGooglers {
	public static void main(String[] args) throws IOException {
		BufferedReader f = new BufferedReader (new FileReader("B-small.in"));
		PrintWriter out = new PrintWriter(new FileWriter("B-small.out"));
		
		int t = Integer.parseInt(f.readLine());
		for (int i = 0; i < t; i++){
			int c = 0;
			StringTokenizer st = new StringTokenizer(f.readLine());
			int n = Integer.parseInt(st.nextToken());
			int[] ti = new int[n];
			int s = Integer.parseInt(st.nextToken());
			int p = Integer.parseInt(st.nextToken());
			for (int j = 0; j < n; j ++){
				ti[j] = Integer.parseInt(st.nextToken());
				if (ti[j] % 3 == 0){
					if (ti[j] / 3 >= p)
						c++;
					else if (ti[j] / 3 == (p-1) && s > 0 && ti[j] >= 2){
						s--;
						c++;
					}
				}
				else if (ti[j] % 3 == 1){
					if ((ti[j] / 3) + 1 >= p)
						c++;					
				}
				else{
					if (ti[j] / 3 >= p-1)
						c++;
					else if (ti[j] / 3 == (p-2) && s > 0){
						s--;
						c++;
					}
				}
					
				
			}
			out.println("Case #" + (i+1) + ": " + c);
			
			
		}
		out.close();
		System.exit(0);
		
		
		
	}
}

import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Scanner;


public class C {
	public static void main(String[] args) throws FileNotFoundException {
		Scanner s=new Scanner(new File("./data/B.txt"));
		PrintWriter pw=new PrintWriter(new File("./data/B_sol.txt"));
		int nCases=s.nextInt();s.nextLine();
		for(int i=0;i<nCases;i++){
			int N=s.nextInt();
			int S=s.nextInt();
			int P=s.nextInt();
			int count=0;
			
			for(int j=0;j<N;j++){
				int T=s.nextInt();
				
				boolean ok=false;
				for(int a=0;a<=10 &&!ok;a++){
					for(int b=0;b<=10&&!ok;b++){
						for(int c=0;c<=10&&!ok;c++){
							if(a+b+c==T && Math.abs(a-b)<=1 && Math.abs(a-c)<=1 && Math.abs(b-c)<=1
									&& (a>=P || b>=P || c>=P))
							{
								ok=true;
								System.out.println(a+" "+b+" "+c+" = "+T);
								
							}
						}
					}
				}
				if(ok)
					count++;
				else
				{
					boolean ok_2=false;
					for(int a=0;a<=10&&!ok_2;a++)
					{
						for(int b=0;b<=10&&!ok_2;b++){
							for(int c=0;c<=10&&!ok_2;c++)
							{
								if(a+b+c==T && Math.abs(a-b)<=2 && Math.abs(a-c)<=2 && Math.abs(b-c)<=2
										&& (a>=P || b>=P || c>=P))
								{
									ok_2=true;
									System.out.println(a+" "+b+" "+c+" = "+T);
								}
										
							}
						}
					}
					if(ok_2 && S>0){
						S--;
						count++;
					}
				}
				
			}
			pw.println("Case #"+(i+1)+": " +count);
			System.out.println("->"+i);
		}
		pw.close();
	}
}
