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 com.mohit.codejam;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;

public class DancingGooglers {

	public static void main(String[] args) {
		try {
			int noOfTests = 0;
			int noGooglers = 0;
			int surprises = 0;
			int expScore = 0;
			int totalScore = 0;
			int withoutSurprise = 0;
			int withSurprise = 0;

			int judgesScore[] = new int[3];
			int temp = 0;

			FileInputStream fis = new FileInputStream("input.txt");
			DataInputStream din = new DataInputStream(fis);
			BufferedReader br = new BufferedReader(new InputStreamReader(din));

			FileWriter fstream = new FileWriter("out.txt");
			BufferedWriter out = new BufferedWriter(fstream);

			String strLine;
			strLine = br.readLine();
			if (strLine == null || strLine == "")
				return;

			strLine = strLine.trim();
			noOfTests = Integer.parseInt(strLine);

			int testNumber = 1;

			while (noOfTests > 0) {
				strLine = br.readLine();
				if (strLine == null || strLine == "" || strLine == "\n")
					break;
				strLine = strLine.trim().toLowerCase();

				String[] records = strLine.split(" ");
				noGooglers = Integer.parseInt(records[0]);
				surprises = Integer.parseInt(records[1]);
				expScore = Integer.parseInt(records[2]);

				withoutSurprise = 0;
				withSurprise = 0;

				// loop to get the scores of Googlers
				for (int i = 0; i < noGooglers; i++) {
					// logic to find score such that difference between them is
					// not more than 1
					totalScore = Integer.parseInt(records[2 + i + 1]);
					judgesScore[0] = totalScore / 3;
					judgesScore[1] = (totalScore - judgesScore[0]) / 2;
					judgesScore[2] = totalScore - judgesScore[0]
							- judgesScore[1];

					// sort the judges score
					for (int k = 0; k < 3; k++) {
						for (int l = k + 1; l < 3; l++) {
							if (judgesScore[k] > judgesScore[l]) {
								temp = judgesScore[k];
								judgesScore[k] = judgesScore[l];
								judgesScore[l] = temp;
							}
						}
					}
					if (judgesScore[2] >= expScore)
						withoutSurprise++;
					else if (judgesScore[2] == (expScore - 1)
							&& (totalScore - judgesScore[2] > 0)
							&& (judgesScore[1] == judgesScore[2]))
						withSurprise++;

				}
				if (withSurprise > surprises)
					withSurprise = surprises;

				out.write("Case #" + testNumber + ": "
						+ (withoutSurprise + withSurprise) + "\n");
				testNumber++;
			}
			br.close();
			out.close();
		} catch (IOException e) {
			System.out.print(e.getMessage());
		}
	}

}
