import java.util.Scanner;
public class B {
	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		for(int zz = 1; zz <= T;zz++){
			int N = in.nextInt();
			int S = in.nextInt();
			int p = in.nextInt();
			int x = 0;
			for(int i = 0; i < N;i++){
				int score = in.nextInt();
				int best = score/3;
				int mod = score%3;
				int diff = p-best;
				if(diff<1){
					x++;
				}else if(diff<2){
					if(mod==0 && score !=0){
						if(S!=0){
							S--;x++;
						}
					}else if(score!=0){
						x++;
					}
				}else if(diff<3){
					if(mod==2){
						if(S!=0){
							S--;x++;
						}
					}
				}
			}
			System.out.format("Case #%d: %d\n", zz, x);
		}
	}
}

package codejam;
import java.util.ArrayList;
import java.util.Collections;
public class DWG {
	int findCount(int N,int S,int p,ArrayList<Integer>arr){
		int count = 0;
		Collections.sort(arr);
		int i = 0;
		while( S != 0 && i<arr.size()){
			int val = 0;
			
			val = arr.get(i);			
			if( (val -3)%3 == 0 && (val-3)>=0){
				int q = (val -3 ) / 3;
				if( (q+2) >=p){
					count++;
					arr.set(i, -1);
					S--;
				}
			}
			else if( (val -2)%3 == 0 &&(val-2)>=0){
				int q = (val -2 ) / 3;
				if( (q+2) >=p){
					count++;
					arr.set(i, -1);
					S--;
				}
			}
			else if( (val -4)%3 == 0 && (val -4)>=0){
				int q = (val -4 ) / 3;
				if( (q+2) >=p){
					count++;
					arr.set(i, -1);
					S--;
				}
			}
			i++;
		}
		for(i = 0; i<N;i++){
			int val = arr.get(i);
			if( val >=0){
				if( (val)%3 == 0){
					int q = (val ) / 3;
					if( (q) >=p){
						count++;
						arr.set(i, -1);						
					}
				}
				else if( (val - 2)%3 == 0 && (val - 2)>=0){
					int q = (val -2 ) / 3;
					if( (q+1) >=p){
						count++;
						arr.set(i, -1);
						
					}
				}
				else if( (val-1)%3 == 0 && (val - 1)>=0){
					int q = (val -1 ) / 3;
					if( (q+1) >=p){
						count++;
						arr.set(i, -1);
						
					}
				}
				
			}
		}	
		
		return count;
	}
	public static void main(String []args){
		DWG d = new DWG();
		
		FileRead fr = new FileRead("B-small-attempt1.in");
		FileWrite fw = new FileWrite("B-small-ouput1.txt");
		
		int num = 0;
		
		int t = fr.readNextInt();
		for(int i = 0; i< t ; i++){
			int arr[] = fr.readNextIntArray();
			
			ArrayList<Integer> a = new ArrayList<Integer>();
			int j = 0;
			for(;j<arr[0];j++){
				a.add(arr[j+3]);
			}
			
			num = d.findCount(arr[0], arr[1], arr[2], a);
			fw.writeLine("Case #"+(i+1)+": "+num);
			
		}
		fw.close();
		fr.close();

	}
}
