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