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.FileInputStream;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.StreamTokenizer;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;

public class B {


	private static void solve(String[] inp) {
		int n = Integer.parseInt(inp[0]);
		int s = Integer.parseInt(inp[1]);
		int p = Integer.parseInt(inp[2]);
		
		int[] mas = new int[n];
		int countSure = 0;
		int countUnsure = 0;
		for(int i = 0; i<n; i++) {
			mas[i] = Integer.parseInt(inp[i+3]);
			
			boolean isSure = false;
			boolean isUnsure = false;
			
			m:for(int i1 = 0; i1<=10; i1++) {
				for(int i2 = i1; i2<=10; i2++) {
					int i3 = mas[i] - i1 - i2;
					if(i3 < i2)continue;					
					
					if(i3 - i1 > 2)continue;
						
					if(i3 >= p) {
						if(i3 - i1 == 2) {
							isUnsure = true;
						} else {
							isUnsure = isSure = true;
							break m;
						}
							
					}
				}
			}
			
			if(isSure)countSure++;
			if(isUnsure)countUnsure++;
		}
		
		out.println(Math.min(countSure + s, countUnsure));
		
	}
	
	public static void main(String[] args) throws Exception {
		int t = Integer.parseInt(inB.readLine());
		for(int _ = 0; _<t; _++) {
			out.print("Case #" + (_+1) + ": ");
			solve(inB.readLine().split(" "));
		}
		out.flush();
	}

	// ///////////////////////////////////////////////////////////////
	// IO
	// ///////////////////////////////////////////////////////////////
	private static StreamTokenizer in;
	private static PrintWriter out;
	private static BufferedReader inB;

	private static boolean FILE = true;

	private static int nextInt() throws Exception {
		in.nextToken();
		return (int) in.nval;
	}

	private static String nextString() throws Exception {
		in.nextToken();
		return in.sval;
	}

	static {
		try {
			out = new PrintWriter(FILE ? (new FileOutputStream("output.txt"))
					: System.out);
			inB = new BufferedReader(new InputStreamReader(
					FILE ? new FileInputStream("B-large.in") : System.in));
		} catch (Exception e) {
			e.printStackTrace();
		}
		in = new StreamTokenizer(inB);
	}

	// ///////////////////////////////////////////////////////////////

	// ///////////////////////////////////////////////////////////////
	// pre - written
	// ///////////////////////////////////////////////////////////////
	private static void println(Object o) throws Exception {
		out.println(o);
		out.flush();
	}

	private static void exit(Object o) throws Exception {
		println(o);
		exit();
	}

	private static void exit() {
		System.exit(0);
	}

	private static final int INF = Integer.MAX_VALUE;
	private static final int MINF = Integer.MIN_VALUE;
	// ////////////////////////////////////////////////////////////////
}
