package code12.qualification;

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

public class B {
	public static String solve(int N, int S, int p, int[] t) {
		
		// 3a 		-> (a, a, a), *(a - 1, a, a + 1)
		// 3a + 1	-> (a, a, a + 1), *(a - 1, a + 1, a + 1)
		// 3a + 2	-> (a, a + 1, a + 1), *(a, a, a + 2)
		
		int numPNoS = 0;
		int numPWithS = 0;
		
		for (int i = 0; i < N; i++) {
			int a = (int)Math.floor(t[i] / 3);
			int r = t[i] % 3;
			
			switch (r) {
			case 0:
				if (a >= p) {
					numPNoS++;
				} else if (a + 1 >= p && a - 1 >= 0) {
					numPWithS++;
				}
				break;
			case 1:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				}
				break;
			case 2:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				} else if (a + 2 >= p) {
					numPWithS++;
				}
				break;
			}
		}
		
		return "" + (numPNoS + Math.min(S, numPWithS));
	}

	public static void main(String[] args) throws Exception {
		// file name
		//String fileName = "Sample";
		//String fileName = "B-small";
		String fileName = "B-large";
		
		// file variable
		File inputFile = new File(fileName + ".in");
		File outputFile = new File(fileName + ".out");
		Scanner scanner = new Scanner(inputFile);
		FileWriter writer = new FileWriter(outputFile);

		// problem variable
		int totalCase;
		int N, S, p;
		int[] t;

		// get total case
		totalCase = scanner.nextInt();

		for (int caseIndex = 1; caseIndex <= totalCase; caseIndex++) {
			// get input
			N = scanner.nextInt();
			S = scanner.nextInt();
			p = scanner.nextInt();
			t = new int[N];
			
			for (int i = 0; i < N; i++) {
				t[i] = scanner.nextInt();
			}
			
			String output = "Case #" + caseIndex + ": " + solve(N, S, p, t);
			System.out.println(output);
			writer.write(output + "\n");
		}
		scanner.close();
		writer.close();
	}
}

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

   public class goog {
      static int surprise;
      public static void main (String [] args) throws Exception {
         BufferedReader f = new BufferedReader(new FileReader("goog.in"));
         PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("goog.out")));
         int N = Integer.parseInt(f.readLine());
         for(int i = 0; i<N; i++){
            String s = f.readLine();
            StringTokenizer st = new StringTokenizer(s);
            int[] hi = new int[Integer.parseInt(st.nextToken())];
            surprise = Integer.parseInt(st.nextToken());
            int p = Integer.parseInt(st.nextToken());
            for(int j = 0; j<hi.length; j++)
               hi[j] = Integer.parseInt(st.nextToken());
            Arrays.sort(hi);
            int count = 0;
            for(int j = hi.length-1; j>=0; j--)
               if(could(hi[j], p))
                  count++;
            out.println("Case #"+(i+1)+": "+count);
         }
         out.close();
         System.exit(0);
      }
      public static boolean could(int i, int greq){
         int[] t = new int[]{Math.max(0, greq-1), Math.max(0, greq-1), greq};
         int sum = 0;
         for(int e:t)
            sum+=e;
         if(sum<=i)
            return true;
         if(surprise>0){
            surprise--;
            t = new int[]{Math.max(0, greq-2), Math.max(0, greq-2), greq};
            sum = 0;
            for(int e:t)
               sum+=e;
            if(sum<=i)
               return true;
         }
         return false;
         // if(i>=3*(greq-1)+1)
            // return true;
         // if(greq == 2){
            // if(greq<2)
               // return false;
            // if(surprise>0)
            // {
               // surprise--;
               // return true;
            // }
            // return false;
         // }
         // if(i<Math.max(greq, 3*(greq-2)+2))
            // return false;
         // if(surprise>0)
         // {
            // surprise--;
            // return true;
         // }
         // return false;
      }
   }