package com.example;

import java.io.IOException;
import java.util.List;

public class ProblemB {
    
    enum Result {
	INSUFFICIENT,
	SUFFICIENT,
	SUFFICIENT_WHEN_SURPRISING
    }

    public static void main(String[] a) throws IOException {

	List<String> lines = FileUtil.getLines("/B-large.in");
	
	int cases = Integer.valueOf(lines.get(0));
	
	for(int c=0; c<cases; c++) {
	    String[] tokens = lines.get(c+1).split(" ");
	    
	    int n = Integer.valueOf(tokens[0]); // N = number of Googlers
	    int s = Integer.valueOf(tokens[1]); // S = number of surprising triplets
	    int p = Integer.valueOf(tokens[2]); // P = __at least__ a score of P
	    
	    int sumSufficient = 0;
	    int sumSufficientSurprising = 0;
	    
	    for(int i=0; i<n; i++) {
		int points = Integer.valueOf(tokens[3+i]);
		
		switch(test(points, p)) {
		case SUFFICIENT:
		    sumSufficient++;
		    break;
		    
		case SUFFICIENT_WHEN_SURPRISING:
		    sumSufficientSurprising++;
		    break;
		}
		
//		uSystem.out.println("points "+ points +" ? "+ p +" => "+ result);
	    }
	    
	    System.out.println("Case #"+ (c+1) +": "+ (sumSufficient + Math.min(s, sumSufficientSurprising)));
	    
//	    System.out.println();
//	    System.out.println("N="+ n +", S="+ s +", P="+ p);
//	    System.out.println();
	}
    }

    private static Result test(int n, int p) {
	int fac = n / 3;
	int rem = n % 3;
	
	if(rem == 0) {
	    
//	    int triplet0[] = { fac, fac, fac };
//	    print(n, triplet0);
	    
	    if(fac >= p) {
		return Result.SUFFICIENT;
	    }
	    
	    if(fac > 0 && fac < 10) {
		
		if(fac+1 >= p) {
		    return Result.SUFFICIENT_WHEN_SURPRISING;
		}
		
//		int triplet1[] = { fac+1, fac, fac-1 }; // surprising 
//		print(n, triplet1);
	    }
	    
	    
	} else if(rem == 1) {
	    
//	    int triplet0[] = { fac+1, fac, fac };
//	    print(n, triplet0);
	    
	    if(fac+1 >= p) {
		return Result.SUFFICIENT;
	    }
	    
//	    if(fac > 0 && fac < 10) {
//		int triplet1[] = { fac+1, fac+1, fac-1 };
//		print(n, triplet1);
//	    }
	    
	} else if(rem == 2) {
	    
//	    int triplet0[] = { fac+1, fac+1, fac };
//	    print(n, triplet0);
	    
	    if(fac+1 >= p) {
		return Result.SUFFICIENT;
	    }
	    
	    if(fac < 9) {
//		int triplet1[] = { fac+2, fac, fac }; // surprising
//		print(n, triplet1);

		if(fac+2 >= p) {
		    return Result.SUFFICIENT_WHEN_SURPRISING;
		}
	    }
	    
	} else {
	    throw new RuntimeException("error");
	}
	
	return Result.INSUFFICIENT;
//	System.out.println();
//	System.out.println(n +" => "+ div3 +" ("+ rem +")");
    }
    
//    private static void print(int n, int[] triplet) {
//	System.out.println("n="+ n +" ("+ (n/3) +","+ (n%3) +") => ["+ triplet[0] +","+ triplet[1] +","+ triplet[2] +"]" + (triplet[0]-triplet[2] > 1 ? " *" : ""));
//    }
    
}

public class DancingWithGooglers {
	public static int[] numbers(int given, boolean check, int p) {
		int[] solution = new int[3];
		int []answer= new int[2];
		int num = given / 3;
		int mod = given % 3;

		solution[0] = num;
		int remain = given - num;
		int newN = remain / 2;
		solution[1] = newN;
		solution[2] = remain - newN;

		if (solution[0] >= p || solution[1] >= p || solution[2] >= p) {
			answer[0]=1;
			answer[1]=0;
			return answer;
		}
		
		if (check) {
			answer[1]=1;
			if ((mod == 0)&&num!=0) {
				solution[0] = num - 1;
				solution[1] = num;
				solution[2] = num + 1;

			} else if ((mod == 1)&&num!=0) {
				solution[0] = num - 1;
				solution[1] = num + 1;
				solution[2] = num + 1;
			} else if (mod == 2) {
				solution[0] = num;
				solution[1] = num;
				solution[2] = num + 2;
			}
		}
		
		if (solution[0] >= p || solution[1] >= p || solution[2] >= p) {
			answer[0]=1;
			
			return answer;
		}
		// System.out.println(solution[0]);
		// System.out.println(solution[1]);
		// System.out.println(solution[2]);
		answer[0]=0;
		answer[1]=0;
		return answer;
		
	}

	public static void solve(String fname) {
		Read r = new Read();
		r.Read(fname);
		String fAnswer="";
		int numOfTest = r.noOfTestCases;
		int[] numOfPlayers = r.N;
		int[] numOfSurprising = r.S;
		int[] ps = r.p;
		int[][] nums = r.all;
		
		for (int i = 0; i < numOfTest; i++) {
			int numOfP = numOfPlayers[i];
			int numOfS = numOfSurprising[i];
			int p = ps[i];
			int[] numsCurr = nums[i];
			int surprised = 0;
			
			int maxNumber = 0;
			for (int j = 0; j < numsCurr.length; j++) {
				if (surprised < numOfS) {
					int []num ;
					num = numbers(numsCurr[j], true, p);
					maxNumber = maxNumber + num[0];
					surprised = surprised + num[1];
				} else {
					int []num ;
					num= numbers(numsCurr[j], false, p);
					maxNumber = maxNumber + num[0];
					surprised = surprised + num[1];
				}
			}
			String ans = "Case #" + (i + 1) + ": " +maxNumber;
			
			fAnswer=fAnswer+ans+"\n";
		}
		System.out.println(fAnswer);
		r.write("out", fAnswer);
	}

	public static void main(String[] args) {
		solve("test");
	}
}
