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();
	}
}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package problemb;

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

/**
 *
 * @author Dr. Reda M. Hussien
 */
public class ProblemB {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) throws FileNotFoundException, IOException {
        // TODO code application logic here
        String DataFile = "E:\\B-small-attempt5.in";
        FileReader fileReader;
        fileReader = new FileReader(DataFile);
        BufferedReader br = new BufferedReader(fileReader);
        int N, S, P, ti, x, r, googlers, surprise;
        String[] values;
        String nextLine = br.readLine();
        int T = Integer.parseInt(nextLine);
        for (int i = 0; i < T; i++) {
            googlers = 0;
            surprise = 0;
            values = br.readLine().split(" ");
            N = Integer.parseInt(values[0]);
            S = Integer.parseInt(values[1]);
            P = Integer.parseInt(values[2]);
            for (int n = 3; n < N + 3; n++) {
                ti = Integer.parseInt(values[n]);
               
                x = ti / 3;
                r = ti % 3;
                switch (r) {
                    case 0:
                        if (x >= P) {

                            googlers++;
                        } else {
                            // check for surprise case:
                            if (S > 0 && x > 0 && x + 1 >= P) {
                                googlers++;
                                S--;
                            }
                        }


                        break;
                    case 1:
                        if (x >= P || x + 1 >= P) {
                            googlers++;

                        } else {
                            // surprise case:
                            if (S > 0 && x + 1 >= P) {

                                googlers++;
                                S--;
                            }
                        }


                        break;
                    case 2:
                         if (x + 1 >= P || x >= P)
          {
            
            googlers++;
          }
          else
          {
            if (S > 0 && x + 2 >= P)
            {
              
              googlers++;
              S--;
            }
          }

         
          break;

                }

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