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.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class Dance {
	
	public static void main(String[] args) {
		BufferedReader reader = null;
		BufferedWriter writer = null;
		try {
            
			if (args.length == 0) {             
				System.out.println("Usage Dance <input_file>");
				System.exit(0);
			}
			
			File inputFile = new File(args[0]);

            if (!inputFile.exists())
            	System.out.println(String.format("File {0} not found in the current directory", args[0]));
            
     
            
			FileReader fileReader = new FileReader(inputFile.getAbsolutePath());
			reader = new BufferedReader(fileReader);
			FileWriter fileWriter = new FileWriter("Output.txt");
			writer = new BufferedWriter(fileWriter);
			String line = reader.readLine();			
			int numberOfTestCases = Integer.parseInt(line);
			for (int i = 0; i < numberOfTestCases; i++) {
				line = reader.readLine();
				String[] tokens = line.split(" ");
				int N = Integer.parseInt(tokens[0]);
				int S = Integer.parseInt(tokens[1]);
				int P = Integer.parseInt(tokens[2]);
				int[] totalScores = new int[N]; 
				for (int j = 3; j < tokens.length; j++) {
					totalScores[j - 3] = Integer.parseInt(tokens[j]);
				}
				writer.write("Case #" + (i + 1) + ": " + maxWithScoreGreaterThanP(P,S,totalScores));
				writer.newLine();
			}
						
		} catch (IOException e) {
			e.printStackTrace();
		} finally {
			try {
			if (reader!=null) {
				reader.close();
			}
			if (writer!=null) {
				writer.close();
			}
			} catch(Exception e) {}
		}		
	}

	private static int maxWithScoreGreaterThanP(int p, int s, int[] totalScores) {
		int count = 0;
		int remainingSurprises = s;
		for (int i = 0; i < totalScores.length; i++) {
			boolean found = false;
			int required = totalScores[i];
			for (int x=p; x<=10 && !found;x++) {
				for (int y = x; y >= x - 2 && y>= 0 && !found;y--) {
					for (int z = x; z >= y && z >=0 ;z--) {				
						if (x + y + z == required ) {
							int min = Math.min(y, z);
							if (min == x - 2 && remainingSurprises > 0){
								found = true;
								count++;
								remainingSurprises--;
								break;
							} else if (min > x-2) {
								found = true;
								count++;
								break;
							}						
						}
					}
				}
			}
		}
		return count;
	}
	
	


}
