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.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashMap;
import java.util.Map;

public class G2012B {

	public static void main(String[] args) throws IOException {
		G2012B trans = new G2012B();
		trans.doMe();
	}

	private static final String ID = "practice";
	private static final String SIZE = "small";
	private static final String CODE = "A";

	private static final String NAME = CODE + "-" + SIZE + "-" + ID;

	public void doMe() throws IOException {
		//File file = new Fil("test.txt");
		File file = new File("B-large.in");
		BufferedWriter out = new BufferedWriter(new FileWriter("output.out"));
		try {
			//use buffering, reading one line at a time
			//FileReader always assumes default encoding is OK!
			BufferedReader input = new BufferedReader(new FileReader(file));
			try {
				String line = input.readLine();
				int count = Integer.parseInt(line);

				for (int i = 0; i < count; i++) {
					line = input.readLine();
					//System.out.println(line);
					int str = this.proccessLine(line.trim());
					out.write("Case #" + (i + 1) + ": " + str);
					if (i < count - 1)
						out.write(System.getProperty("line.separator"));
					System.out.println(str);
				}
			} finally {
				input.close();
				out.flush();
				out.close();
			}
		} catch (IOException ex) {
			ex.printStackTrace();
		}
	}

	int proccessLine(String line) {
		String st[] = line.split(" ");
		int n = Integer.parseInt(st[0]);
		int s = Integer.parseInt(st[1]);
		int p = Integer.parseInt(st[2]);
		int sol = 0;
		for (int i = 3	; i < st.length; i++) {
			int u = calc(Integer.parseInt(st[i]), p);
			if (u==1) sol++;
			if (u==2 && s>0) {
				sol++;
				s--;
			}
		}
		return sol;
	}
	
	public int calc(int n, int t) {
		if(n==0) {
			if (t==0) return 1;
			else return 0;
		}
		if(n==1) {
			if (t<=1) return 1;
			else return 0;
		}
		if (n==2) {
			if (t==2) return 2;
			if (t<=1) return 1;
			return 0;
		}
		
		if (t<=1) return 1;
		n -= t;
		if ((t-1)*2<=n) {
			return 1;
		} 
		if ((t-2)*2<=n) {
			return 2;
		}
		return 0;
	}
}
