package CodeJam.c2012.clasificacion;

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;

/**
 * Problem
 *
 * You're watching a show where Googlers (employees of Google) dance, and then
 * each dancer is given a triplet of scores by three judges. Each triplet of
 * scores consists of three integer scores from 0 to 10 inclusive. The judges
 * have very similar standards, so it's surprising if a triplet of scores
 * contains two scores that are 2 apart. No triplet of scores contains scores
 * that are more than 2 apart.
 *
 * For example: (8, 8, 8) and (7, 8, 7) are not surprising. (6, 7, 8) and (6, 8,
 * 8) are surprising. (7, 6, 9) will never happen.
 *
 * The total points for a Googler is the sum of the three scores in that
 * Googler's triplet of scores. The best result for a Googler is the maximum of
 * the three scores in that Googler's triplet of scores. Given the total points
 * for each Googler, as well as the number of surprising triplets of scores,
 * what is the maximum number of Googlers that could have had a best result of
 * at least p?
 *
 * For example, suppose there were 6 Googlers, and they had the following total
 * points: 29, 20, 8, 18, 18, 21. You remember that there were 2 surprising
 * triplets of scores, and you want to know how many Googlers could have gotten
 * a best result of 8 or better.
 *
 * With those total points, and knowing that two of the triplets were
 * surprising, the triplets of scores could have been:
 *
 * 10 9 10 6 6 8 (*) 2 3 3 6 6 6 6 6 6 6 7 8 (*)
 *
 * The cases marked with a (*) are the surprising cases. This gives us 3
 * Googlers who got at least one score of 8 or better. There's no series of
 * triplets of scores that would give us a higher number than 3, so the answer
 * is 3.
 *
 * Input
 *
 * The first line of the input gives the number of test cases, T. T test cases
 * follow. Each test case consists of a single line containing integers
 * separated by single spaces. The first integer will be N, the number of
 * Googlers, and the second integer will be S, the number of surprising triplets
 * of scores. The third integer will be p, as described above. Next will be N
 * integers ti: the total points of the Googlers.
 *
 * Output
 *
 * For each test case, output one line containing "Case #x: y", where x is the
 * case number (starting from 1) and y is the maximum number of Googlers who
 * could have had a best result of greater than or equal to p.
 *
 * Limits
 *
 * 1 â¤ T â¤ 100. 0 â¤ S â¤ N. 0 â¤ p â¤ 10. 0 â¤ ti â¤ 30. At least S of the ti values
 * will be between 2 and 28, inclusive.
 *
 * Small dataset
 *
 * 1 â¤ N â¤ 3.
 *
 * Large dataset
 *
 * 1 â¤ N â¤ 100.
 *
 * Sample
 *
 * Input Output 4 Case #1: 3 3 1 5 15 13 11 Case #2: 2 3 0 8 23 22 21 Case #3: 1
 * 2 1 1 8 0 Case #4: 3 6 2 8 29 20 8 18 18 21
 *
 * @author Leandro Baena Torres
 */
public class B {

    public static void main(String[] args) throws FileNotFoundException, IOException {
        BufferedReader br = new BufferedReader(new FileReader("B.in"));
        String linea;
        int numCasos, N, S, p, t[], y, minSurprise, minNoSurprise;

        linea = br.readLine();
        numCasos = Integer.parseInt(linea);
        for (int i = 0; i < numCasos; i++) {
            linea = br.readLine();
            String[] aux = linea.split(" ");
            N = Integer.parseInt(aux[0]);
            S = Integer.parseInt(aux[1]);
            p = Integer.parseInt(aux[2]);
            t = new int[N];
            y = 0;
            minSurprise = p + ((p - 2) >= 0 ? (p - 2) : 0) + ((p - 2) >= 0 ? (p - 2) : 0);
            minNoSurprise = p + ((p - 1) >= 0 ? (p - 1) : 0) + ((p - 1) >= 0 ? (p - 1) : 0);
            for (int j = 0; j < N; j++) {
                t[j] = Integer.parseInt(aux[3 + j]);
                if (t[j] >= minNoSurprise) {
                    y++;
                } else {
                    if (t[j] >= minSurprise) {
                        if (S > 0) {
                            y++;
                            S--;
                        }
                    }
                }
            }

            System.out.println("Case #" + (i + 1) + ": " + y);
        }
    }
}

/**
 * B.java
 * @author Joel C. Soares
 */
import java.util.Scanner;
import java.util.LinkedList;
import java.util.Collections;
 
class Googlers implements Comparable<Googlers>
{
	int n1, n2, n3;
	int restando;
	
	Googlers( int a, int b, int c, int r)
	{
		n1 = a; n2 = b; n3 = c; restando = r;
	} 
	
	public int compareTo( Googlers g )
	{
		if( n3 > g.n3 )
			return 1;
		else if( n3 < g.n3 )
			return -1;
		else
			return 0;
	} 
	
} // fim de classe

public class B
{
	// remove grupos que tem notas maiores que p
	public static int countGooglers( LinkedList<Googlers> lista, int p )
	{
		int count = 0;
		
		for( int i = 0; i < lista.size(); i++ )
		{
			if( lista.get( i ).n3 >= p )
				count++;
		}
		
		return count;
	} 

	// faz ajuste para casos surpreendentes
	public static void ajusteGooglersSurpreendentes( LinkedList<Googlers> lista, int p, int s )
	{
		Googlers g;
		
		// coloca em ordem
		Collections.sort( lista );
		
		for( int i = lista.size() - 1; i >= 0; i-- )
		{
			g = lista.get( i );
			if( s > 0 && g.n3 < p )
			{
				if( g.restando >= 2 )
				{
					g.restando -= 2;
					g.n3 += 2;
					if( g.restando > 0 )
					{
						g.restando--;
						g.n2++;
					}
					s--;
				}				
			}
		} // fim de for
	} 
	
	public static void ajusteGooglers( LinkedList<Googlers> lista, int p, int s )
	{
		for( Googlers g : lista )
		{
			if( g.n3 + 1 >= p || g.n3 + 2 < p || g.restando == 1 ||
				s == 0 )
			{
				if( g.restando > 0 )
				{
					g.restando--;
					g.n3++;
				}
				if( g.restando > 0 )
				{
					g.restando--;
					g.n2++;
				}
				if( g.restando > 0 )
				{
					g.restando--;
					g.n1++;
				}
			} // fim de if
		} // fim de for
	} // fim de método
	
	public static boolean existeResto( LinkedList<Googlers> lista )
	{
		for( Googlers g : lista )
			if( g.restando > 0 )
				return true;
		
		return false;
	}
	
	public static void main( String args[] )
	{
		Scanner input = new Scanner( System.in );
		int t, n, s, p, x, v;
		LinkedList<Googlers> lista = new LinkedList<Googlers>();
		
		t = input.nextInt();
		for( int i = 0; i < t; i++ )
		{
			n = input.nextInt();
			s = input.nextInt();
			p = input.nextInt();
			lista.clear();
			for( int j = 0; j < n; j++ )
			{
				x = input.nextInt();
				v = x / 3;
				x = x % 3;
				
				// ajusta
				if( x == 0 && v > 0 )
				{
					x = 3;
					v = v - 1;
				} 
				
				lista.add( new Googlers( v, v, v, x ) );					
			} // fim de for
			
			// faz ajuste triviais
			ajusteGooglers( lista, p, s );
			
			// faz ajuste surpreendentes
			ajusteGooglersSurpreendentes( lista, p, s );
			
			System.out.printf( "Case #%d: %d\n", i + 1, countGooglers( lista, p ) );
		} // fim de for externo
	}
}