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

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.*;

public class DancingWithGooglers {

	
	public static void main(String[] args)  throws IOException
	{
		BufferedReader br = new BufferedReader(new InputStreamReader(new FileInputStream("input2.txt")));
		int inputSize = Integer.parseInt(br.readLine());
		 
		
		BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(new FileOutputStream("output2.txt")));
		for(int x = 1 ; x <= inputSize ; x++ )
		{
			
			String line = br.readLine();
			String[] lineArray = line.split(" ");
			int n = Integer.parseInt(lineArray[0]);
			int s = Integer.parseInt(lineArray[1]);
			int p = Integer.parseInt(lineArray[2]);
			int array[] = new int[n];
			for (int i = 0 ; i< n ; i++)
			{
				array[i] = Integer.parseInt(lineArray[i + 3]);
			}
			bw.write("Case #"+x+": "+findP(n,s,p,array)+"\n");
		}
	bw.flush();
	bw.close();
	br.close();
		
		
		int j[] = {15, 13, 11};
		int i = findP(3,1,5,j);
		System.out.println(i);
	}
	
	public static int findP(int numberOfGooglers, int surprisingTriplets, int p, int totalScores[])
	{
		int answer = 0;
		
		int border0 = 0; 
		int border1 = 0 ; 
		int border2 = 0;
		
		int totalScore, best;
		if (p == 0)
		{
			return numberOfGooglers;
		}
		else
		{
			for(int i = 0 ; i < numberOfGooglers ; i ++)
			{
				totalScore = totalScores[i];
				if (totalScore == 0)
				{/*do nothing*/}
				else if( totalScore % 3 == 0 )
				{
					best = totalScore / 3;
					if (best >= p)
						answer += 1;
					else if(best == (p-1) )
						border0 += 1;
				}
				else if( totalScore % 3 == 1 )
				{
					best = ( totalScore + 2) / 3;
					if (best >= p)
						answer += 1;
					else if(best == (p-1) )
						border1 += 1;
				}
				else
				{
					best = (totalScore + 1) / 3;
					if (best >= p)
						answer += 1;
					else if(best == (p-1) )
						border2 += 1;
				}
			
			}
		}
		

		if(border0 >= surprisingTriplets)
		{
			border0 -= surprisingTriplets;
			answer += surprisingTriplets;
			surprisingTriplets = 0;
		}
		else
		{
			answer += border0;
			surprisingTriplets -= border0;
			border0 = 0;
		}
		
		if(border2 >= surprisingTriplets)
		{
			border2 -= surprisingTriplets;
			answer += surprisingTriplets;
			surprisingTriplets = 0;
		}
		else
		{
			answer += border2;
			surprisingTriplets -= border2;
			border2 = 0;
		}
		
		return answer;
	}

}
