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 ? " *" : ""));
//    }
    
}

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;



public class googlers {

	public static void main(String[] args) throws IOException {
		 BufferedReader f = new BufferedReader(new FileReader("B-large.in"));
		 // input file name goes above
		 PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("googlers.out")));
		 int x=Integer.parseInt(f.readLine());
		 for (int i = 0; i < x; i++) {
			 int output=0;
			 StringTokenizer base=new StringTokenizer(f.readLine());
			 int no=Integer.parseInt(base.nextToken());
			 int sur=Integer.parseInt(base.nextToken());
			 int max=Integer.parseInt(base.nextToken());
			 
			 int [] sum=new int [no];
			 for (int j = 0; j < no; j++) {
				sum[j]=Integer.parseInt(base.nextToken());
			}
			int[][] calc = new int[no][3];
			for (int j = 0; j < no; j++) {
				if(sum[j]%3!=2)
				{
					calc[j][0]=sum[j]/3;
					calc[j][1]=sum[j]/3;
					calc[j][2]=sum[j]-2*sum[j]/3;
				}
				else{
					calc[j][0] = sum[j] / 3+1;
					calc[j][1] = sum[j] / 3;
					calc[j][2] = sum[j] -(sum[j] / 3 +sum[j]/3+1);	
				}
			}
			for (int j = 0; j < no; j++) {
				boolean found = false;
				for (int j2 = 0; j2 < 3 && !found; j2++) {
					if (calc[j][j2] >= max) {
						output++;
						found = true;
					}
				}
				if (!found) {
					for (int j2 = 0; j2 < 3 && !found && sur > 0; j2++) {
						if (calc[j][j2] + 1 >= max) {
							if(sum[j]>2&& sum[j]%3!=1)
							{
								output++;
								sur--;
								found = true;	
							}
						}
					}
				}
			}
			out.println("Case #"+(i+1)+": "+output);
		}
		 out.close();
		 f.close();
	}
	
}
