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 ? " *" : ""));
//    }
    
}

package qualificationround;

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

public class ProblemBDancingGooglers {

	public ProblemBDancingGooglers() {
		try {
			FileReader fr = new FileReader("B-large.in");
			BufferedReader br = new BufferedReader(fr);
			
			FileWriter fw = new FileWriter("B-large.out");
			BufferedWriter bw = new BufferedWriter(fw);
			
			int numCases = Integer.parseInt(br.readLine());
			int caseNum = 1;
			
			String line = br.readLine();
			while (line != null) {
				System.out.println(line);
				int numGooglers = getNumGooglersFromLine(line);
				int numSurprises = getNumSurprisesFromLine(line);
				int bestScore = getBestScoreFromLine(line);
				int[] scores = getScoresFromLine(line, numGooglers);
				
				int possibles = 0;
				for (int i=0; i<scores.length; i++) {
					int withSurprise = bestScoreWithSurprise(scores[i]);
					int withoutSurprise = bestScoreNoSurprise(scores[i]);
					
					if (withoutSurprise >= bestScore) {
						possibles++;
					} else if (withSurprise >= bestScore && numSurprises > 0) {
						possibles++;
						numSurprises--;
					}
				}
				
				String output = "Case #"+ caseNum;
				output += ": "+possibles;
				
				System.out.println(output);
				bw.append(output);
				if (caseNum != numCases)
					bw.newLine();
				
				caseNum++;
				line = br.readLine();
			}
			
			bw.flush();
			bw.close();
			br.close();
			
		} catch(Exception e) {
			e.printStackTrace();
		}
	}
	
	public int[] getScoresFromLine(String line, int numScores) {
		int[] scores = new int[numScores];

		int firstSpace = line.indexOf(" ");
		int secondSpace = line.indexOf(" ",firstSpace + 1);
		int thirdSpace = line.indexOf(" ",secondSpace + 1);
		
		line = line.substring(thirdSpace + 1);
		
		String[] scoreStrings = line.split(" ");
		for (int i=0; i<scoreStrings.length; i++) {
			scores[i] = Integer.parseInt(scoreStrings[i]);
		}
		
		return scores;
	}
	
	public int getNumGooglersFromLine(String line) {
		String[] split = line.split(" ");
		return Integer.parseInt(split[0]);
	}
	
	public int getNumSurprisesFromLine(String line) {
		String[] split = line.split(" ");
		return Integer.parseInt(split[1]);
	}
	
	public int getBestScoreFromLine(String line) {
		String[] split = line.split(" ");
		return Integer.parseInt(split[2]);
	}
	
	/**
	 * 
	 * @param totalScore
	 * @return the best possible score without a surprise
	 */
	public int bestScoreNoSurprise(int totalScore) {
		return Math.min(totalScore, (totalScore + 2) / 3);
	}
	
	/**
	 * 
	 * @param totalScore
	 * @return the best possible score with a surprise
	 */
	public int bestScoreWithSurprise(int totalScore) {
		return Math.min(totalScore,Math.min((totalScore + 4) / 3,10));
	}
	
	public static void main(String[] args) {
		new ProblemBDancingGooglers();
	}

}
