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

/**
 * Copyright 2012 Christopher Schmitz. All Rights Reserved.
 */

package com.isotopeent.codejam.lib;

import java.io.File;
import java.io.IOException;
import java.text.DateFormat;
import java.text.SimpleDateFormat;
import java.util.Calendar;

public class Utils {

	private static final String FILE_IN_EXTENSION = ".in";
	private static final String FILE_OUT_EXTENSION = ".out";
	private static final String OUT_DATE_FORMAT = "_yyyy-MM-dd_HH-mm-ss";

	public static <T> void solve(String filePath, String fileName, InputConverter<T> inputConverter, SolverBase<T> solver) {
		File folder = new File(filePath);
		File fin = getInputFile(folder, fileName);
		File fout = getOutputFile(folder, fileName);
		if (!fout.exists()) {
			try {
				fout.createNewFile();
			} catch (IOException e) {
				System.err.println("Error creating file " + fout.getAbsolutePath());
				e.printStackTrace();
			}
		}
		InputReader<T> reader = null;
		SolutionWriter writer = null;
		try {
			reader = new InputReader<T>(fin, inputConverter);
			solver.init(reader);
			writer = new SolutionWriter(fout);
	
			int caseNum = 1;
			String solution;
			long startTime = System.currentTimeMillis();
			while ((solution = solver.solveNext()) != null) {
				writer.writeSolution(caseNum++, solution);
				writer.flush();
			}
			int time = (int)(System.currentTimeMillis() - startTime);
			System.out.println("Done in " + (time / 1000) + " seconds (" + (time / (caseNum - 1)) + "ms average)");
		} catch (Exception e) {
			System.err.println("Error solving");
			e.printStackTrace();
		}
		if (reader != null) {
			try {
				reader.close();
			} catch (IOException e) {
				// do nothing
			}
		}
		if (writer != null) {
			writer.flush();
			writer.close();
		}
	}

	public static File getInputFile(File folder, String fileName) {
		return new File(folder, fileName + FILE_IN_EXTENSION);
	}

	public static File getOutputFile(File folder, String fileName) {
		DateFormat dateFormat = new SimpleDateFormat(OUT_DATE_FORMAT);
		String date = dateFormat.format(Calendar.getInstance().getTime());
		return new File(folder, fileName + date + FILE_OUT_EXTENSION);
	}

	public static String[] convertToStringArray(String line) {
		return line.split(" ");
	}

	public static int[] convertToIntArray(String line, int count) {
		int[] items = new int[count];
		int wordStart = 0;
		for (int i = 0; i < count; i++) {
			int wordEnd = line.indexOf(' ', wordStart);
			if (wordEnd < 0) {
				wordEnd = line.length();
			}
			int param = Integer.parseInt(line.substring(wordStart, wordEnd));
			items[i] = param;
			wordStart = wordEnd + 1;
		}
		return items;
	}

	public static int convertToIntArray(String line, int[] itemsOut) {
		int count = 0;
		int wordStart = 0;
		int length = line.length();
		while (wordStart < length) {
			int wordEnd = line.indexOf(' ', wordStart);
			if (wordEnd < 0) {
				wordEnd = line.length();
			}
			int param = Integer.parseInt(line.substring(wordStart, wordEnd));
			itemsOut[count++] = param;
			wordStart = wordEnd + 1;
		}
		return count;
	}

}
