package dancinggooglers;

import java.io.File;
import java.util.Scanner;

public class DanceScoreCalculator {


    public static void main(String[] args) {
        if(args.length <= 0 || args[0] == null) {
            System.out.println("You must enter a file to read");
            System.out.println("Usage: blah <filename>");
            System.exit(0);
        }

        File argFile = new File(args[0]);
        try {
            Scanner googleSpeakScanner = new Scanner(argFile);
            String firstLine = googleSpeakScanner.nextLine();
            Integer linesToScan = new Integer(firstLine);
            for(int i = 1; i <= linesToScan; i++) {
                String googleDancerLine = googleSpeakScanner.nextLine();
                DanceScoreCase danceCase = new DanceScoreCase(googleDancerLine);
                System.out.println(String.format("Case #%d: %d", i, danceCase.maxDancersThatCouldPass()));
            }
        }
        catch (Exception e) {
            e.printStackTrace();
        }
    }
}


import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;

class DancingGooglers{
    public static void main(String[] args)
    throws Exception{
        BufferedReader br = new BufferedReader(new FileReader("in.in"));
        BufferedWriter bw = new BufferedWriter(new FileWriter("out.txt"));
        int T = Integer.parseInt(br.readLine());

        for(int i=0; i<T; i++){
            String in = br.readLine();
            String[] inp = in.split(" ", 4);
            int N = Integer.parseInt(inp[0]);
            int S = Integer.parseInt(inp[1]);
            int p = Integer.parseInt(inp[2]);
            int nos = 0;
            String[] input = inp[3].split(" ");
            int[] t = new int[N];
            int[] r = new int[N];
            for(int j=0;j<N;j++){
                t[j] = Integer.parseInt(input[j]);
                r[j] = t[j]%3;
                t[j] /= 3;
                if(t[j] >= p)
                    nos++;
                if(t[j] == p - 1){
                    if(r[j] > 0)
                        nos++;
                    else if(t[j]>0){
                        nos++;
                        S--;
                    }
                }
                if(t[j] == p-2){
                    if(r[j] == 2){
                        nos++;
                        S--;
                    }
                }
            }
            if(S<0)
                nos += S;
            bw.write("Case #"+(i+1)+": "+nos+"\n");
        }
        bw.close();
    }
}