/**
 * Created by IntelliJ IDEA.
 * User: Administrator
 * Date: 3/3/12
 * Time: 11:00 AM
 * To change this template use File | Settings | File Templates.
 */

import SRMLib.MathLibrary;
import SRMLib.TestSRMLib;
import com.sun.org.apache.bcel.internal.generic.F2D;

import java.io.*;
import java.util.*;
import java.util.zip.Inflater;

public class SRM {
    public static void main(String[] args) throws IOException {
        //TestSRMLib.run();
        codeJam1.main();

        return;
    }
}
class codeJam1 {
    public static void main() throws IOException {
        String inputPath = "E:\\input.txt";
        String outputPath = "E:\\output.txt";
        BufferedReader input = new BufferedReader(new FileReader(inputPath));
        BufferedWriter output = new BufferedWriter(new FileWriter(outputPath));

        String line;
        line = input.readLine();
        int T = Integer.parseInt(line);
        for (int i = 1; i <= T; ++i) {
            line = input.readLine();
            String[] words = line.split(" ");
            int N = Integer.parseInt(words[0]);
            int S = Integer.parseInt(words[1]);
            int p = Integer.parseInt(words[2]);
            int n = 0;
            int res = 0;

            for (int j = 3; j < words.length; ++j) {
                if (p == 0) {
                    res++;
                    continue;
                }

                int t = Integer.parseInt(words[j]);
                if (p == 1) {
                    if (t > 0)
                        res++;
                    continue;
                }
                if (t >= 3 * p - 2)
                    res++;
                else if (t >= 3 * p - 4)
                    n++;
            }

            res += Math.min(n, S);
            output.write("Case #" + i + ": " + res);
            output.newLine();
        }

        input.close();
        output.close();
    }
}


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

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
/**
 *
 * @author xeyyam
 */
public class DancingWiththeGooglers {

    boolean[][] ansNoS = new boolean[31][11];
    boolean[][] ansS = new boolean[31][11];

    public static void main(String args[]) throws Exception {
        new DancingWiththeGooglers().solve();
    }

    public void solve() throws Exception {
        generate();

        Scanner sc = new Scanner(new File("B-small-attempt0.in"));
        PrintWriter pw = new PrintWriter("B-small-attempt0.out");
        int t, n, s, p;

        t = sc.nextInt();

        for (int i = 1; i <= t; i++) {
            n = sc.nextInt();
            s = sc.nextInt();
            p = sc.nextInt();
            int ans = 0;
            int temp = 0;
            
            for(int j = 1 ; j<=n ; j++ ){
                temp = sc.nextInt();
                if( check(temp , p , false) ) ans++;
                else if( s>0 && check(temp , p , true ) ){ ans++ ; s--;}
                
            }
            
            pw.println("Case #"+i+": "+ans);
        }

        pw.flush();
        pw.close();

    }
    
    public boolean check(int sum , int p , boolean surprise){
        
        if( !surprise )
        for(int i = p ; i<=10 ; i++){
            if( ansNoS[sum][i]  )
                return true;
        }
        else{
            
        for(int i = p ; i<=10 ; i++){
            if( ansS[sum][i]  )
                return true;
        }
        }
        
        return false;
    }

    public void generate() {
        for (int i = 0; i <= 10; i++) {
            for (int j = 0; j <= 10; j++) {
                for (int k = 0; k <= 10; k++) {
                    if (Math.abs(j - i) <= 1 && Math.abs(k - j) <= 1 && Math.abs(i - k) <= 1) {
                        ansNoS[i + j + k][i] = true;
                        ansNoS[i + j + k][j] = true;
                        ansNoS[i + j + k][k] = true;
                    } else if (Math.abs(j - i) <= 2 && Math.abs(k - j) <= 2 && Math.abs(i - k) <= 2) {
                        ansS[i + j + k][i] = true;
                        ansS[i + j + k][j] = true;
                        ansS[i + j + k][k] = true;
                    }
                }
            }
        }
    }
}
