package com.example;

import java.io.IOException;
import java.util.List;

public class ProblemB {
    
    enum Result {
	INSUFFICIENT,
	SUFFICIENT,
	SUFFICIENT_WHEN_SURPRISING
    }

    public static void main(String[] a) throws IOException {

	List<String> lines = FileUtil.getLines("/B-large.in");
	
	int cases = Integer.valueOf(lines.get(0));
	
	for(int c=0; c<cases; c++) {
	    String[] tokens = lines.get(c+1).split(" ");
	    
	    int n = Integer.valueOf(tokens[0]); // N = number of Googlers
	    int s = Integer.valueOf(tokens[1]); // S = number of surprising triplets
	    int p = Integer.valueOf(tokens[2]); // P = __at least__ a score of P
	    
	    int sumSufficient = 0;
	    int sumSufficientSurprising = 0;
	    
	    for(int i=0; i<n; i++) {
		int points = Integer.valueOf(tokens[3+i]);
		
		switch(test(points, p)) {
		case SUFFICIENT:
		    sumSufficient++;
		    break;
		    
		case SUFFICIENT_WHEN_SURPRISING:
		    sumSufficientSurprising++;
		    break;
		}
		
//		uSystem.out.println("points "+ points +" ? "+ p +" => "+ result);
	    }
	    
	    System.out.println("Case #"+ (c+1) +": "+ (sumSufficient + Math.min(s, sumSufficientSurprising)));
	    
//	    System.out.println();
//	    System.out.println("N="+ n +", S="+ s +", P="+ p);
//	    System.out.println();
	}
    }

    private static Result test(int n, int p) {
	int fac = n / 3;
	int rem = n % 3;
	
	if(rem == 0) {
	    
//	    int triplet0[] = { fac, fac, fac };
//	    print(n, triplet0);
	    
	    if(fac >= p) {
		return Result.SUFFICIENT;
	    }
	    
	    if(fac > 0 && fac < 10) {
		
		if(fac+1 >= p) {
		    return Result.SUFFICIENT_WHEN_SURPRISING;
		}
		
//		int triplet1[] = { fac+1, fac, fac-1 }; // surprising 
//		print(n, triplet1);
	    }
	    
	    
	} else if(rem == 1) {
	    
//	    int triplet0[] = { fac+1, fac, fac };
//	    print(n, triplet0);
	    
	    if(fac+1 >= p) {
		return Result.SUFFICIENT;
	    }
	    
//	    if(fac > 0 && fac < 10) {
//		int triplet1[] = { fac+1, fac+1, fac-1 };
//		print(n, triplet1);
//	    }
	    
	} else if(rem == 2) {
	    
//	    int triplet0[] = { fac+1, fac+1, fac };
//	    print(n, triplet0);
	    
	    if(fac+1 >= p) {
		return Result.SUFFICIENT;
	    }
	    
	    if(fac < 9) {
//		int triplet1[] = { fac+2, fac, fac }; // surprising
//		print(n, triplet1);

		if(fac+2 >= p) {
		    return Result.SUFFICIENT_WHEN_SURPRISING;
		}
	    }
	    
	} else {
	    throw new RuntimeException("error");
	}
	
	return Result.INSUFFICIENT;
//	System.out.println();
//	System.out.println(n +" => "+ div3 +" ("+ rem +")");
    }
    
//    private static void print(int n, int[] triplet) {
//	System.out.println("n="+ n +" ("+ (n/3) +","+ (n%3) +") => ["+ triplet[0] +","+ triplet[1] +","+ triplet[2] +"]" + (triplet[0]-triplet[2] > 1 ? " *" : ""));
//    }
    
}

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.ArrayList;

public class DancingGooglers 
{
	String line="Code Jam";
	static int noOfTCs;
	
	public static void main(String[] args)
	{
		//initialize();
		new DancingGooglers().calculate();
		//generateOPFile();
	}
	
	private void calculate() 
	{
		try
		{
			BufferedReader br = new BufferedReader(new FileReader("C:/CodeJam/B-large.in"));
			FileWriter fw = new FileWriter("C:/CodeJam/B-large-output.txt");
			BufferedWriter bw = new BufferedWriter(fw);
			line = br.readLine().trim();
			noOfTCs = Integer.parseInt(line);
			int dancers,surprises,maxScore;
			for(int testCase=0;testCase<noOfTCs;testCase++)
			{
				line = br.readLine().trim();
				String[] input = line.split(" ");
				dancers = Integer.parseInt(input[0]);
				surprises = Integer.parseInt(input[1]);
				maxScore = Integer.parseInt(input[2]);
				int sum,maxDancers=0;
				
				for(int i=3; i<input.length;i++)
				{
					sum =  Integer.parseInt(input[i]);
					int rem = sum%3;
					int result = sum/3;
					if(rem <= 1) 
					{
						if((result+rem)>=maxScore)
							maxDancers++;
						else if(rem == 0 && result > 0 && (result+1)>=maxScore && surprises > 0)
						{
							maxDancers++;
							surprises--;
						}
					}
					else
					{
						if((1+result) >= maxScore)
						{
							maxDancers++;
						}
						else
						{
							if(surprises > 0 && (rem+result) >= maxScore)
							{
								maxDancers++;
								surprises--;
							}
						}
					}
					
				}
				
				line = "Case #"+(testCase+1)+": "+maxDancers;
				System.out.println(line);
				bw.write(line);
				bw.newLine();
			}
			br.close();
			bw.close();
			System.out.println("Done !");
		}
		catch(Exception e)
		{
			e.printStackTrace();
		}
	}
	
	/*static void generateOPFile()
	{
		try
		{
			FileWriter fw = new FileWriter("C:/CodeJam/output.txt");
			BufferedWriter bw = new BufferedWriter(fw);
			for(int i=1;i<=noOfTCs;i++)
			{
				line = "Case #"+i+": "+1;
				bw.write(line);
				bw.newLine();
			}			
			bw.close();
		}
		catch(Exception e)
		{
			e.printStackTrace();
		}
	}*/

	/*static void initialize()
	{
		try
		{
			BufferedReader br = new BufferedReader(new FileReader("C:/CodeJam/C-small.in"));
			line = br.readLine().trim();
			noOfTCs = Integer.parseInt(line);
			br.close();
			
		}
		catch(Exception e)
		{
			e.printStackTrace();
		}
	}*/
}
