import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class Dancing {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// read input file
		File file = new File("B-small-attempt4.in");
		//File file = new File("input.txt");
		BufferedReader br = new BufferedReader(new FileReader(file));
		String ln = "";
		int count = Integer.parseInt(br.readLine());

		// write output file
		File out = new File("outB.txt");
		BufferedWriter bw = new BufferedWriter(new FileWriter(out));
		
		int y = 0;
		for (int i=0; i < count; i++){
			ln = br.readLine();
			y = getY(ln);
			bw.write("Case #" + (i+1) + ": " + y);
			bw.newLine();
		}
		bw.close();
	}
	
	private static int getY(String str) {
		String[] data = str.split(" ");
		int n = Integer.parseInt(data[0]);
		int s = Integer.parseInt(data[1]);
		int p = Integer.parseInt(data[2]);
		int[] t = new int[n];
		for (int i=0; i < n; i++){
			t[i] = Integer.parseInt(data[i+3]);
		}
		int y = 0;
		int base = 0;
		for(int j=0; j < t.length; j++){
			base = t[j] / 3;
			if(base >= p) { y++; }
			else if(base == p-1){
				if(t[j] - (base+p) > base-1 && t[j] > 0){
					y++;
				} else if(s>0 && t[j] - (base+p) > base-2 && t[j] > 0){
					s -= 1;
					y++;
				}
			} else if(base == p-2){
				if(s > 0 && t[j] - (base+p) > base-1 && t[j] > 0){
					s -= 1;
					y++;
				}
			}
		}
		
		return y;
	}

}

import java.io.*;
import java.util.*;

class Main
{
	public static void main(String[] args) throws Exception
	{
		Main m = new Main();
		m.foo();
	}
	
	long count = 0;
	void foo() throws Exception
	{
//		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		Scanner s = new Scanner(System.in);
		
		int T = s.nextInt();
		int testNum = 1;
		while(T-->0)
		{
			int numGooglers = s.nextInt();
			int numSurprises = s.nextInt();
			int p = s.nextInt();
			
			int[] scores = new int[numGooglers];
			for(int k=0; k<scores.length; k++)
			{
				scores[k] = s.nextInt();
			}
			
			Arrays.sort(scores);
			
			int ret = 0;
			for(int k=0; k<scores.length; k++)
			{
				int sc = scores[k];
				
				if(sc < p)
					continue;
				
				int d = sc/3;
				int r = sc%3;
				//System.out.printf("sc: %d, d: %d, r: %d\n", sc, d, r);
				
				if(r==0)
				{
					if(d >= p)
					{
						ret++;
						continue;
					}
					// TODO: Handle a surprise
					if(d+1 >= p && numSurprises != 0)
					{
						ret++;
						numSurprises--;
						continue;
					}
				}
				else if(r==1)
				{
					if(d+1 >= p)
					{
						ret++;
						continue;
					}
					// TODO: Handle a surprise
					// I can't.
				}
				else if(r==2)
				{
					if(d+1 >= p)
					{
						ret++;
						continue;
					}
					// TODO: Handle a surprise
					if(d+2 >= p && numSurprises != 0)
					{
						ret++;
						numSurprises--;
						continue;
					}
				}
				
			}
			//ret += numSurprises;
			//ret -= Math.max(0, numSurp - numSurprises);
			
			//System.out.printf("Known surprises: %d, Found surprises: %d\n", numSurprises, numSurp);
			System.out.printf("Case #%d: %d\n", testNum, ret);
			testNum++;
		}
	}
}