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.FileReader;
import java.io.FileWriter;
import java.io.IOException;

public class DancingWithTheGooglers {
    public static void main(String[] args) throws IOException {
        printMaxPossibleHighScorers(new BufferedReader(new FileReader("B-large.in")), new BufferedWriter(new FileWriter("out.txt")));
    }
    
    public static void printMaxPossibleHighScorers(BufferedReader in, BufferedWriter out) throws IOException {
        String line = in.readLine(); // we don't need to read num test cases
        int caseNum = 1;
        
        while ((line = in.readLine()) != null && line.length() != 0 ) {
            String result = "Case #" + caseNum + ": ";
            
            String[] lineDetails = line.split(" ");
            int n = Integer.parseInt(lineDetails[0]);   // googlers
            int s = Integer.parseInt(lineDetails[1]);   // surprises
            int p = Integer.parseInt(lineDetails[2]);   // high score
            int[] googlers = new int[lineDetails.length-3];
            
            for (int j = 3; j < lineDetails.length; j++) {
                googlers[j-3] = Integer.parseInt(lineDetails[j]);
            }
            
            int maxPossibleHighScorers = 0;
            int possibleHighScorers = 0;
            int surprisesLeft = s;
            for (int j = 0; j < n; j++) {
                int score = googlers[j];
                int base = score / 3;
                int offset = score % 3;
                int maxScore = -1;
                if (base > 0) {
                	maxScore = (offset == 0 ? base : base + 1);
                    if ((p - maxScore == 1) && offset != 1 && surprisesLeft > 0) {
                        maxScore++;
                        surprisesLeft--;
                    }
                } else {
                	maxScore = (score == 0 ? 0 : 1);
                    if ((p - maxScore == 1) && offset == 2 && surprisesLeft > 0) {
                        maxScore++;
                        surprisesLeft--;
                    }
                }
                 
                if (maxScore >= p) {
                    possibleHighScorers++;
                }
            }
            if (possibleHighScorers > maxPossibleHighScorers) {
                maxPossibleHighScorers = possibleHighScorers;
            }
            result += maxPossibleHighScorers;
            
            out.write(result);
            out.newLine();
            caseNum++;
        }
        in.close();
        out.close();
    }
}
