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 dancing.with.the.googlers;

/**
 *
 * @author Optee
 */
public class ScoreCounter {

    int numberOfGooglers;
    int surpriseCount;
    int minScore;
    int[] scores;

    public ScoreCounter(String line) {
        String[] numbers = line.split(" ");
        this.numberOfGooglers = Integer.valueOf(numbers[0]);
        this.surpriseCount = Integer.valueOf(numbers[1]);
        this.minScore = Integer.valueOf(numbers[2]);
        this.scores = new int[numbers.length-3];
        int j = 0;
        for (int i = 3; i < numbers.length; i++) {
            scores[j++] = Integer.valueOf(numbers[i]);
        }
    }
    
    int Count2() {
        int winners = 0;
        Integer surprise = surpriseCount;
        
        for (int i = 0; i < numberOfGooglers; i++) {
            int score = this.scores[i];
            int minCount = minScore * 3;
            if(score == 0 && minScore > 0) continue;
            if (score + 2 >= minCount) {
                winners++;
            }
            else if (score + 4 >= minCount && surprise > 0) {
                surprise--;
                winners++;
            }
        }
        return winners;
    }
    
    int Count() throws Exception {
        int winners = 0;
        Integer surprise = surpriseCount;
        Integer possibleSurprises = 0;
        
        for (int i = 0; i < numberOfGooglers; i++) {
            int score = this.scores[i];
            int tail = score - minScore;
            
            if (tail <= 0) continue;
            
            int divTileOne = tail/2;
            int divTileTwo = tail - divTileOne;
            
            if (Math.max(divTileOne, divTileTwo) >= minScore){
                if (Math.max(divTileOne, divTileTwo) - minScore >=2)
                    possibleSurprises++;
                winners++;
            }
            else if (minScore - Math.min(divTileOne, divTileTwo) < 2) {
                winners++;
            }
            else if (minScore - Math.min(divTileOne, divTileTwo) == 2) {
                if (surprise > 0) {
                    surprise--;
                    winners++;
                }
            }
        }            
        return winners;
    }
    
}
