import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class Dancing {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// read input file
		File file = new File("B-small-attempt4.in");
		//File file = new File("input.txt");
		BufferedReader br = new BufferedReader(new FileReader(file));
		String ln = "";
		int count = Integer.parseInt(br.readLine());

		// write output file
		File out = new File("outB.txt");
		BufferedWriter bw = new BufferedWriter(new FileWriter(out));
		
		int y = 0;
		for (int i=0; i < count; i++){
			ln = br.readLine();
			y = getY(ln);
			bw.write("Case #" + (i+1) + ": " + y);
			bw.newLine();
		}
		bw.close();
	}
	
	private static int getY(String str) {
		String[] data = str.split(" ");
		int n = Integer.parseInt(data[0]);
		int s = Integer.parseInt(data[1]);
		int p = Integer.parseInt(data[2]);
		int[] t = new int[n];
		for (int i=0; i < n; i++){
			t[i] = Integer.parseInt(data[i+3]);
		}
		int y = 0;
		int base = 0;
		for(int j=0; j < t.length; j++){
			base = t[j] / 3;
			if(base >= p) { y++; }
			else if(base == p-1){
				if(t[j] - (base+p) > base-1 && t[j] > 0){
					y++;
				} else if(s>0 && t[j] - (base+p) > base-2 && t[j] > 0){
					s -= 1;
					y++;
				}
			} else if(base == p-2){
				if(s > 0 && t[j] - (base+p) > base-1 && t[j] > 0){
					s -= 1;
					y++;
				}
			}
		}
		
		return y;
	}

}

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

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.Scanner;
import java.util.StringTokenizer;

/**
 *
 * @author ahmet
 */
public class codeJam {
    
    
    public static void main(String[] args) throws FileNotFoundException, IOException
    {
        Scanner scan = new Scanner(System.in);
        
        
        int T = scan.nextInt();
        
        for(int i = 0; i < T; i++)
        {
            ArrayList<Integer> list = new ArrayList<Integer>();
            int howMany = scan.nextInt();
            int S = scan.nextInt();
            int p = scan.nextInt();
            
            for(int ii = 0; ii < howMany; ii++)
            {
                list.add(scan.nextInt());
            }
            Collections.sort(list);
            System.out.println("Case #" + (i + 1) + ": " + analiz(list, S, p));
        }  
    }
    
    public static String analiz( ArrayList <Integer> a, int S, int p)
    {
        int count = 0;
        for(int i = 0; i < a.size(); i++)
        {
            if(a.get(i)/3 >= p)
            {
                 a.set(i, -1);
                 count++;
            }
        }   
        for(int i = 0; i < a.size(); i++)
        {
            if(a.get(i) == -1)
            {
                 a.remove(i);
                 i=0;
            }
        }
        while(S >= 0 && a.size() > 0 && a.get(a.size() - 1 ) > 0)
        {
            if(a.get(a.size() - 1 )%3 == 0 )
            {
                if(a.get(a.size() - 1)/3 + 1 >= p && S != 0)
                {
                    count++;
                    S--;
                }
                else
                    break;
            }
            else if(a.get(a.size() - 1 ) % 3 == 1)
            {
                if(a.get(a.size() - 1)/3 + 1 >= p)
                {
                    count++;
                }
                else
                    break;

            }
            else if(a.get(a.size() - 1 ) % 3 == 2)
            {
                if(a.get(a.size() - 1) /3 + 1 >= p)
                {
                    count++;
                }      
                else if(a.get(a.size() - 1)/3 + 2 >= p && S != 0)
                {
                    count++;
                    S--;
                }
                else
                    break;
            }     
            a.remove(a.size() - 1 );            
        }
        
        return "" + count;
    }
    
}
