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

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.util.ArrayList;
    
/**
 * 
 * @author dannocz
 */
public class InputReader {
    
    public static Input readFile(String filename){
        try {
              
              /*  Sets up a file reader to read the file passed on the command
          77        line one character at a time */
              FileReader input = new FileReader(filename);
              
              /* Filter FileReader through a Buffered read to read a line at a
                 time */
              BufferedReader bufRead = new BufferedReader(input);
              
              String line;    // String that holds current file line
              int count = 0;  // Line number of count 
              ArrayList<String> cases= new ArrayList<String>();
              
              // Read first line
              line = bufRead.readLine();
              int noTestCases=Integer.parseInt(line);
              count++;
              
              // Read through file one line at time. Print line # and line
              while (count<=noTestCases){
                  //System.out.println("Reading. "+count+": "+line);
                  line = bufRead.readLine();
                  cases.add(line);
                  count++;
              }
              
              bufRead.close();
              
              return new Input(noTestCases,cases);
              
          }catch (ArrayIndexOutOfBoundsException e){
              /* If no file was passed on the command line, this expception is
              generated. A message indicating how to the class should be
              called is displayed */
              e.printStackTrace();        
  
          }catch (IOException e){
              // If another exception is generated, print a stack trace
              e.printStackTrace();
          }
        
        return null;
          
      }// end main
    }

import java.util.Comparator;
import java.util.PriorityQueue;
import java.util.Scanner;


public class GCJ_2 {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
		
		int T = scan.nextInt();
		scan.nextLine();
		
		int nCase = 1;
		while (T-- > 0) {
			
			int N = scan.nextInt();
			int S = scan.nextInt();
			int p = scan.nextInt();
			
			PriorityQueue<Integer> queue = new PriorityQueue<Integer>(10, new Comparator<Integer>() {

				@Override
				public int compare(Integer o1, Integer o2) {
					
					return o2.compareTo(o1);
				}
				
			});
			for (int i = 0; i < N; i++) {
				queue.add(scan.nextInt());
			}
			
			int output = 0;
			while (!queue.isEmpty() && S >= 0) {
				Integer i = queue.poll();
				//System.out.println(i);
				int r = i % 3;
				int q = i / 3;
				
				if (r != 0) q++;
				
				//dont need to be surprising
				if (q >= p) {
					output++;
					continue;
				}
				
				if (S == 0) break; //dont need continue processing
				if (q == 0) continue;
				//needs to use surprising
				S--;
				if (r == 0) //everybody is equal
				{
					q++;
				} else if (r == 1)  
				{
					//cant add
				} else {
					q++;
				}
				
				if (q >= p) output++;
				
			}
			
			
			scan.nextLine();
			
			System.out.println("Case #" + (nCase++) + ": " + output);
		}

	}

}
