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.*;
import java.io.*;

public class DancingWithTheGooglers{
   public static void main(String[] args) throws Exception{
      BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
      Formatter formatter = new Formatter(System.out);
      int T = Integer.parseInt(br.readLine());
      String[] dataStr;
      int[] data;
      int lineNum=1;
      while(T-->0){
	 dataStr = br.readLine().split("\\s");
	 data=new int[dataStr.length-3];
	 for(int i=0;i<data.length;i++){
	    data[i]=Integer.parseInt(dataStr[i+3]);
	 }
	 formatter.format("Case #%d: %d\n",lineNum++, solve(Integer.parseInt(dataStr[0]),Integer.parseInt(dataStr[1]), Integer.parseInt(dataStr[2]),data));
      }
      formatter.close();
   }
   private static int solve(int N, int S,int p, int[] dances){
      int best=0;
      int maybe=0;
      int div3=0;
      for(int i=0;i<N;i++){
	 div3=dances[i]/3;
	 if(div3>=p || (div3==p-1 && dances[i] % 3>=1)) {
	    best++;
	    continue;
	 }
	 if((div3 == p - 1 && div3>=1) || (div3==p-2 && dances[i]%3==2)){
	    maybe++;
	    continue;
	 }
      }
      return best+Math.min(S,maybe);
   }
}
