import java.io.*;
import java.math.*;
import java.util.*;
import java.text.*;

public class b {
    public static void main(String[] args) {
        Scanner sc = new Scanner(new BufferedInputStream(System.in));

        int T = sc.nextInt();

        for (int casenumber = 1; casenumber <= T; ++casenumber) {

            int n = sc.nextInt();
            int s = sc.nextInt();
            int p = sc.nextInt();

            int[] ts = new int[n];
            for (int i = 0; i < n; ++i)
                ts[i] = sc.nextInt();

            int thresh1 = (p == 1 ? 1 : (3 * p - 4));
            int thresh2 = (3 * p - 2);

            int count1 = 0, count2 = 0;

            for (int i = 0; i < n; ++i) {
                if (ts[i] >= thresh2) {
                    ++count2;
                    continue;
                }
                if (ts[i] >= thresh1) {
                    ++count1;
                }
            }

            if (count1 > s) {
                count1 = s;
            }

            System.out.format("Case #%d: %d%n", casenumber, count1 + count2);
        }
    }
}

/**
 * Dancing With the Googlers
 */

package com.google.jam.qualification;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintStream;
import java.util.Scanner;

public class B {

	public static void main(String[] args) {
		try {
			FileOutputStream fos = new FileOutputStream("B-small-attempt0.out");
			System.setOut(new PrintStream(fos, true));
			
			FileInputStream fis=new FileInputStream(new File("B-small-attempt0.in"));
			InputStreamReader in=new InputStreamReader(fis);
			BufferedReader br=new BufferedReader(in);
			
			String line="";
			int nbTest = Integer.parseInt(br.readLine());
			
			for(int i=1; i<=nbTest; i++) {
				line = br.readLine();
				Scanner sc = new Scanner(line);
				int nbJ = sc.nextInt();
				int nbS = sc.nextInt();
				int minPoint = sc.nextInt();
				
				int res = 0;
				boolean stop = false;
				for(int j=0; j<nbJ && !stop; j++) {
					int total = sc.nextInt();
					int moy = total / 3;
					int reste = total%3;
					
					if(moy >= minPoint) res++;
					else if((moy+1)>= minPoint) {
						if(reste==2 || reste ==1) res++;
						else if(nbS>0 && reste==0 && moy>0) {
							res++;
							nbS--;
						}
						
					}
					else if((moy+2)>= minPoint) {
						if(nbS>0 && reste==2) {
							res++;
							nbS--;
						}
					}
					
				}
				
				System.out.println("Case #" + i + ": " + res);
			}
	
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			System.out.println("File not found");
			e.printStackTrace();
		}
		catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}

	}

}
