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 ulohy;

import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Scanner;

public class Codejam_2 {
	
	static byte cases;
	static int[] googlers = new int[100];
	static int[] supr_triplets = new int[100];
	static int[][] total_scores = new int[100][100];
	static int[][] max = new int[100][100];
	static int[][] supr_max = new int[100][100];
	static int[] treshold = new int[100];
	static int[] result = new int[100];
	
	public static void read_input() {
		
		Scanner s = null;
		try {
			s = new Scanner(new FileReader("./src/ulohy/B-small-attempt0.in"));
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		}
		
		cases = s.nextByte();		
		
		for (int i = 0; i < cases; i++) {
			googlers[i] = s.nextInt();
			supr_triplets[i] = s.nextInt();
			treshold[i] = s.nextInt();
			for (int j = 0; j < googlers[i]; j++) {
				total_scores[i][j] = s.nextInt();				
			}			
		}

		s.close();	
	}
	
	public static void write_output() {
		FileWriter outFile;
		try {
			outFile = new FileWriter("./src/ulohy/output");		
			PrintWriter out = new PrintWriter(outFile);
			for (int i = 1; i <= cases; i++) {
				out.println("Case #"+i+": "+result[i-1]);				
			}
			out.close();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}	
	
	public static void main(String args[]) {
		
		read_input();
		
		for (int i = 0; i < cases; i++) {			
			for (int j = 0; j < googlers[i]; j++) {
				if (total_scores[i][j] > 0) {
					switch (total_scores[i][j] % 3) {
					case 0:
						max[i][j] = total_scores[i][j]/3;
						supr_max[i][j] = total_scores[i][j]/3 + 1;
						break;
					case 1:
						max[i][j] = total_scores[i][j]/3 + 1;
						supr_max[i][j] = total_scores[i][j]/3 + 1;
						break;
					case 2:
						max[i][j] = total_scores[i][j]/3 + 1;
						supr_max[i][j] = total_scores[i][j]/3 + 2;
						break;
					default:
						break;
					}
				}
			}
			
			for (int j = 0; j < googlers[i]; j++) {
				if (max[i][j] >= treshold[i]) {
					result[i]++;
				} else {
					if (supr_max[i][j] >= treshold[i] && supr_triplets[i] > 0) {
						result[i]++;
						supr_triplets[i]--;
					}
				}
			}
		}
		
		write_output();
		
	}

}
