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

/*
 * Dancing
 * Jason Bradley Nel
 * 16287398
 */
import java.io.*;

public class Dancing {

    public static void main(String[] args) {

        In input = new In("input.txt");
        int T = Integer.parseInt(input.readLine());

        for (int i = 0; i < T; i++) {
            System.out.printf("Case #%d: ", i + 1);
            int N = input.readInt();
            int s = input.readInt();
            int p = input.readInt();
            int c = 0;//counter for >=p cases
            //System.out.printf("N: %d, S: %d, P: %d, R: ", N, s, p);
            
            for (int j = 0; j < N; j++) {
                
                int score = input.readInt();
                int q = score / 3;
                int m = score % 3;
                //System.out.printf("%2d (%d, %d) ", scores[j], q, m);
                                
                switch (m) {
                    case 0:
                        if (q >= p) {
                            c++;
                        } else if (((q + 1) == p) && (s > 0) && (q != 0)) {
                            c++;
                            s--;
                        }
                        break;
                    case 1:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        }
                        break;
                    case 2:
                        if (q >= p) {
                            c++;
                        } else if ((q + 1) == p) {
                            c++;
                        } else if (((q + 2) == p) && (s > 0)) {
                            c++;
                            s--;
                        }
                        break;
                }
            }
            //System.out.printf("Best result of %d or higher: ", p);
            System.out.println(c);
        }


    }
}

import java.io.File;
import java.io.IOException;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;

public class Dancing {

	public static void main(String[] args) throws IOException{
		Scanner sc = new Scanner(new File("dancing.in"));
		System.setOut(new PrintStream(new File("dancing.out")));
		ArrayList<Googler> changeAble = new ArrayList<Googler>(100);
		int t = sc.nextInt();
		for(int i=1; i<=t; i++){
			changeAble.clear();
			int n = sc.nextInt();//number of googlers
			int s = sc.nextInt();//number of surprises
			int p = sc.nextInt();//target
			int y = 0;//number that match
			for(int j=0; j<n; j++){
				Googler temp = new Googler(sc.nextInt(),p);
				if(temp.distAway < 1)
					y++;
				else if(temp.changeAble){
					changeAble.add(temp);
				}
			}
			Collections.sort(changeAble);
			for(int j=0; j<s && j<changeAble.size(); j++){
				Googler temp = changeAble.get(j);
				if(temp.maxScore+1 < p)
					break;
				y++;
			}
			System.out.println("Case #"+i+": "+y);
		}

	}

}
class Googler implements Comparable<Googler>{
	int distAway;
	boolean changeAble = false;
	int maxScore;
	int sScore;
	int score;
	int t;
	public Googler(int score, int target){
		t = target;
		this.score=score;
		int i = score/3;
		if(i*3==score){
			maxScore = i;
			changeAble = true;
		}
		else if(i*2+i+1 == score)
			maxScore = i+1;
		else if(i+(i+1)*2==score){
			maxScore = i+1;
			changeAble = true;
		}
		if(maxScore==0)
			changeAble = false;
		distAway = target-maxScore;
	}
	public int compareTo(Googler g){
		return distAway-g.distAway;
	}
	public String toString(){
		return score+"";
	}
}
