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.util.*;

public class DancingGoogler{

    public static void main(String[] args){
	Scanner scanner = new Scanner(System.in);
	scanner.nextLine();
	int count = 1;
	while(scanner.hasNextLine()){
	    String[] tokens = scanner.nextLine().split(" ");
	    int numContestants = Integer.parseInt(tokens[0]);
	    int numSuprises = Integer.parseInt(tokens[1]);
	    int minScore = Integer.parseInt(tokens[2]);
	    int[] scores = new int[numContestants];
	    for(int i = 0; i < scores.length; ++i){
		scores[i] = Integer.parseInt(tokens[i + 3]);
	    }
	    DancingGoogler d = new DancingGoogler(numSuprises, minScore, scores);
	    System.out.println("Case #" + count + ": " + d.getNumGooglersWithMinScore());
	    ++count;
	}
    }

    public DancingGoogler(int numSuprises, int minScore, int[] scores){
	this.numSuprises = numSuprises;
	this.minScore = minScore;
	this.scores = scores;
    }

    public int getNumGooglersWithMinScore(){
	int count = 0;
	for(int score : scores){
	    if(score == 0){
		if(minScore == 0){
		    ++count;
		}
		continue;
	    }
	    if(score == 29){
		++count;
		continue;
	    }
	    if(score % 3 == 0){
		int av = score / 3;
		if(av >= minScore){
		    ++count;
		}else{
		    if(numSuprises > 0 && av >= minScore -1){
			++count;
			--numSuprises;
		    }
		}
		continue;
	    }
	    int av = score / 3;
	    int av1 = (score / 3) + 1;
	    int diffav = score - av * 3;
	    int diffav1 = av1 * 3 - score;
	    if(numSuprises > 0){
		if(diffav == 2){
		    if(av1 >= minScore){
			++count;
			continue;
		    }else{
			if(av >= minScore ||  score - av*2 >= minScore){
			    ++count;
			    --numSuprises;
			    continue;
			}
		    }
		}else{
		    if(av >= minScore || score -av * 2 >= minScore){
			++count;
			continue;
		    }
		    if(av1 >= minScore){
			++count;
			--numSuprises;
			continue;
		    }
		}
	    }else{
		if(diffav == 2){
		    if(av1 >= minScore){
			++count;
			continue;
		    }
		}else{
		    if(av >= minScore || score - av*2 >= minScore){
			++count;
			continue;
		    }
		}
	    }
	}
	return count;
    }

    private int numContestants;
    private int numSuprises;
    private int minScore;
    private int[] scores;
}