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 codejam.dancing;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class Main {
	static int  suprising, minScore;
	public static void main(String[] args){
		try {
			// open input file
			BufferedReader in = new BufferedReader ( new InputStreamReader (System.in));
			BufferedReader file = new BufferedReader (new FileReader(in.readLine()));
			// create output file
			FileWriter fstream = new FileWriter("output.out");
			BufferedWriter out = new BufferedWriter(fstream);
			
			// Variables
			StringTokenizer strtok;
			String str, tok;
			int entries, count, googlers, res, g_count,temp;
			
			// retrieve number of entries
			entries = new Integer(file.readLine());
			System.out.println("Entries : " + entries);
			
			count = 0;
			// read lines
			while (((str = file.readLine())!=null) & (count <= entries))
			{
				res = 0;
				strtok = new StringTokenizer(str);
				// number of googlers
				googlers = Integer.parseInt(strtok.nextToken());
				System.out.println("Googlers : "+ googlers);
				// number of suprising entries
				suprising = Integer.parseInt(strtok.nextToken());
				System.out.println("Suprising Scores : " + suprising);
				// minimum score
				minScore = Integer.parseInt(strtok.nextToken());
				System.out.println("Minimum Score : " + minScore);
				
				g_count = 0;
				while (g_count < googlers)
				{
					//temp = Integer.parseInt(strtok.nextToken());
					//System.out.println(temp);
					res += evalScore(Integer.parseInt(strtok.nextToken()));
					g_count++;
				}
				System.out.println("finished?");
				count++;
				out.write("Case #"+count+": "+res+"\n");
			}
			out.close();
		}
		catch(Exception e){
			
		}
	}
	
	public static int evalScore(int score)
	{
		// check for non suprising results
		System.out.print("["+ minScore + "|" + score+"]");
		if (score >= (3*minScore - 2))
		{
			System.out.print(" : 1\n");
			return 1;
		} else if (score == 0){
			System.out.print(" : 0\n");
			return 0;
		} else {
			// check for suprising results
			if (suprising > 0){
				if ((score < (3*minScore - 2))&(score >= (3*minScore - 4)))
				{
					suprising--;
					System.out.print(" : 1\n");
					return 1;
				}
			}
		}
		System.out.print(" : 0\n");
		return 0;
	}
}
