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;
	}

}

import java.util.Scanner;
import java.io.*;

public class Dancing {

  public static void main(String[] args) throws FileNotFoundException, IOException {
    Scanner input = new Scanner(new File(args[0]));
    Scanner lin;
    int lines = 0;
    
    if (input.hasNextInt()) {
      lines = input.nextInt();
      input.nextLine();
    }
    
    String nLine;
    
    PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("output.txt")));
    
    int googlers, surprising, p;
    int divThree, rem, cases, surprisingCases, answer;
    int[] points;

    for (int i = 0; i < lines; i++) {
      nLine = input.nextLine();
      lin = new Scanner(nLine);
      out.print("Case #" + (i + 1) + ": ");
      
      googlers = lin.nextInt();
      surprising = lin.nextInt();
      p = lin.nextInt();
      points = new int[googlers];
      for (int j = 0; j < googlers; j++) {
        points[j] = lin.nextInt();
      }
      
      cases = 0;
      surprisingCases = 0;
      
      for (int k = 0; k < googlers; k++) {
        divThree = points[k] / 3;
        rem = points[k] % 3;
        if (rem == 0) {
          if (divThree >= p)
            cases++;
          else if (divThree + 1 >= p && divThree != 0)
            surprisingCases++;
        }
        else if (rem == 1) {
          if (divThree + 1 >= p)
            cases++;
        }
        else if (rem == 2) {
          if (divThree + 1 >= p)
            cases++;
          else if (divThree + 2 >= p)
            surprisingCases++;
        }
      }
      
      if (surprisingCases >= surprising) {
        answer = surprising;
      }
      else {
        answer = surprisingCases;
      }
      answer += cases;
        
      out.println(answer);
    }
    
    out.close();
  
  }

}