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.File;
import java.io.FileReader;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;

/**
 * 
 */

/**
 * @author Shweta
 * 
 */
public class DancingGoogler {

	/**
	 * @param list
	 * @param minimumScore
	 * @param numberOfSurprisingResults
	 */
	private List<Googler> list;
	private int numberOfSurprisingResults, minimumScore;
	private int maxNumberOfGooglersForBestResult;

	public DancingGoogler(List<Googler> list, int numberOfSurprisingResults,
			int minimumScore) {
		this.list = list;
		Collections.sort(this.list);
		this.numberOfSurprisingResults = numberOfSurprisingResults;
		this.minimumScore = minimumScore;
		putScores(this.list);
		calculateAnswer();
	}

	/**
	 * 
	 */
	private void calculateAnswer() {
		for (Googler googler : this.list) {
			boolean minScoreGiven = false;
			for (int i = 0; i < 3; i++) {
				int score = googler.getScores()[i];
				if (score >= minimumScore) {
					minScoreGiven = true;
					break;
				}
			}
			if (minScoreGiven) {
				maxNumberOfGooglersForBestResult++;
			} else if (numberOfSurprisingResults > 0) {
				if (googler.getMaxScore() > 0) {
					googler.getScores()[1] = googler.getScores()[1] - 1;
					googler.getScores()[2] = googler.getScores()[2] + 1;

					if (googler.getScores()[2] >= minimumScore) {
						maxNumberOfGooglersForBestResult++;
						numberOfSurprisingResults--;
					}
				}
			}
		}
	}

	/**
	 * @param list2
	 */
	private void putScores(List<Googler> googlers) {
		for (Googler googler : googlers) {
			int maxScore = googler.getMaxScore();
			int[] scores = new int[3];
			int base = maxScore / 3;
			scores[0] = base;
			scores[1] = base;
			scores[2] = base;

			if (maxScore % 3 == 1) {
				scores[1] = base + 1;
			} else if (maxScore % 3 == 2) {
				scores[1] = base + 1;
				scores[2] = base + 1;
			}

			googler.setScores(scores);
		}
	}

	/**
	 * @return
	 */
	public int answer() {
		return maxNumberOfGooglersForBestResult;
	}

	public static void main(String args[]) throws Exception {
		BufferedReader bufferedReader = new BufferedReader(
				new FileReader(
						new File(
								"C:\\Documents and Settings\\Kamlesh\\Desktop\\codejam\\B-large.in")));
		int numberOfTest = Integer.valueOf(bufferedReader.readLine());
		for (int i = 1; i <= numberOfTest; i++) {
			String line = bufferedReader.readLine();
			String tokens[] = line.split("\\ ");
			int n = Integer.valueOf(tokens[0]);
			int surprizingTriplets = Integer.valueOf(tokens[1]);
			int minimumScore = Integer.valueOf(tokens[2]);
			List<Googler> list = new ArrayList<Googler>();
			for (int j = 1; j <= n; j++) {
				int maxScore = Integer.valueOf(tokens[2 + j]);
				Googler googler = new Googler(maxScore);
				list.add(googler);
			}
			DancingGoogler dc = new DancingGoogler(list, surprizingTriplets,
					minimumScore);

			System.out.println("Case #" + i + ": " + dc.answer());

		}
	}

}
