package code12.qualification;

import java.io.File;
import java.io.FileWriter;
import java.util.Scanner;

public class B {
	public static String solve(int N, int S, int p, int[] t) {
		
		// 3a 		-> (a, a, a), *(a - 1, a, a + 1)
		// 3a + 1	-> (a, a, a + 1), *(a - 1, a + 1, a + 1)
		// 3a + 2	-> (a, a + 1, a + 1), *(a, a, a + 2)
		
		int numPNoS = 0;
		int numPWithS = 0;
		
		for (int i = 0; i < N; i++) {
			int a = (int)Math.floor(t[i] / 3);
			int r = t[i] % 3;
			
			switch (r) {
			case 0:
				if (a >= p) {
					numPNoS++;
				} else if (a + 1 >= p && a - 1 >= 0) {
					numPWithS++;
				}
				break;
			case 1:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				}
				break;
			case 2:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				} else if (a + 2 >= p) {
					numPWithS++;
				}
				break;
			}
		}
		
		return "" + (numPNoS + Math.min(S, numPWithS));
	}

	public static void main(String[] args) throws Exception {
		// file name
		//String fileName = "Sample";
		//String fileName = "B-small";
		String fileName = "B-large";
		
		// file variable
		File inputFile = new File(fileName + ".in");
		File outputFile = new File(fileName + ".out");
		Scanner scanner = new Scanner(inputFile);
		FileWriter writer = new FileWriter(outputFile);

		// problem variable
		int totalCase;
		int N, S, p;
		int[] t;

		// get total case
		totalCase = scanner.nextInt();

		for (int caseIndex = 1; caseIndex <= totalCase; caseIndex++) {
			// get input
			N = scanner.nextInt();
			S = scanner.nextInt();
			p = scanner.nextInt();
			t = new int[N];
			
			for (int i = 0; i < N; i++) {
				t[i] = scanner.nextInt();
			}
			
			String output = "Case #" + caseIndex + ": " + solve(N, S, p, t);
			System.out.println(output);
			writer.write(output + "\n");
		}
		scanner.close();
		writer.close();
	}
}


import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;

public class Dancing
{
    
    static int n;
    static int[] score;
    
    static int solve( int surp, int p )
    {
        int notPossible = 0;
        int cutOff = 3*p - 4;
        int surCutOff = 3*p-2;
        

        Arrays.sort( score );

        if( p == 0 )
            return n;

        if( p==1 ) // only score of zero is invalid
        {
            for( int i=0; i<n; i++ )
            {
                if( score[ i ] == 0 )
                    notPossible++;

                else
                    break;
            }
            
            return n-notPossible;
        }

        for( int i=0; i<n; i++ )
        {
            /* if( score[ i ] <= p )
            {
                notPossible++;
                continue;
            } */
            
            if( score[ i ]< cutOff )
            {
                notPossible++;
                continue;
            }

            // check if surprising
            else if(score[i] < surCutOff) // surprising possible
            {
                if( surp > 0 )
                {
                    surp--;
                    continue;
                }

                else
                {
                    notPossible++;
                }
            }

            else if( score[ i ] >= surCutOff )
            {
                break;
            }



            else
                break;

        }

        
        return n-notPossible;
        
    }

    public static void main( String[] args ) throws IOException
    {
        FileWriter fr= new FileWriter("/home/gowri/Desktop/out.txt");
        BufferedWriter out = new BufferedWriter( fr );
        BufferedReader br = new BufferedReader( new InputStreamReader( System.in ));
        int T = Integer.parseInt( br.readLine() );
        String s;
        StringTokenizer tok;

        for( int i=0; i<T; i++ )
        {
            s = br.readLine();
            tok = new StringTokenizer( s );
            
            n = Integer.parseInt( tok.nextToken() );
            score = new int[ n ];

            int surp = Integer.parseInt( tok.nextToken() );
            int p = Integer.parseInt( tok.nextToken() );

            for( int j=0; j<n; j++ )
            {
                score[ j ] = Integer.parseInt( tok.nextToken() );
            }

            String res = String.format( "Case #%d: ", i+1 );
            out.write( res );
            out.write( ( "" + solve( surp, p ) ) );
            out.newLine();
        }

        out.close();
    }

}

