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.*;
import java.util.*;

public class DancingWithGooglers {
	public static void main(String... args) throws Exception {

		BufferedReader br = new BufferedReader(new FileReader(
				System.getProperty("user.home") + "/Desktop/googlers.in"));

		BufferedWriter bw = new BufferedWriter(new FileWriter(
				System.getProperty("user.home") + "/Desktop/googlers.out"));

		Map<Integer, TripleCounter> dictionary = new HashMap<Integer, TripleCounter>();

		for (int x = 0; x <= 10; x++) {
			dictionary.put(x + x + x, new TripleCounter(x, x, x, false));
			if (x >= 10)
				continue;
			dictionary
					.put(x + x + x + 1, new TripleCounter(x, x, x + 1, false));
			dictionary.put(x + x + 1 + x + 1, new TripleCounter(x, x + 1,
					x + 1, false));
		}

		Map<Integer, TripleCounter> specialdictionary = new HashMap<Integer, TripleCounter>();

		for (int x = 0; x <= 8; x++) {
			specialdictionary.put(x + x + x + 2, new TripleCounter(x, x, x + 2,
					true));
			specialdictionary.put(x + x + 2 + x + 2, new TripleCounter(x,
					x + 2, x + 2, true));
			specialdictionary.put(x + x + 1 + x + 2, new TripleCounter(x,
					x + 1, x + 2, true));
		}

		int times = Integer.parseInt(br.readLine());

		for (int i = 0; i < times; i++) {
			googlers(br.readLine(), dictionary, specialdictionary, bw, i + 1);
		}

		bw.flush();
		bw.close();
	}

	public static void googlers(String line,
			Map<Integer, TripleCounter> dictionary,
			Map<Integer, TripleCounter> specialdictionary, BufferedWriter bw,
			int num) throws IOException {
		String[] split = line.split(" ");

		int special = Integer.parseInt(split[1]);
		int p = Integer.parseInt(split[2]);
		List<Integer> scores = new ArrayList<Integer>();
		int count = 0;

		for (int i = 3; i < split.length; i++) {
			scores.add(Integer.parseInt(split[i]));
		}

		for (int i : scores) {
			TripleCounter c = dictionary.get(i);
			if (c != null && c.hasGreaterOrEqualTo(p)) {
				count++;
				continue;
			}

			c = specialdictionary.get(i);
			if (special > 0) {
				if (c != null && c.hasGreaterOrEqualTo(p)) {
					count++;
					special--;
				}
			}
		}

		bw.write("Case #" + num + ": " + count);
		if (num < 100)
			bw.write("\n");
	}

}

class TripleCounter {

	public int x, y, z;
	public boolean special;

	public TripleCounter(int x, int y, int z, boolean special) {
		this.x = x;
		this.y = y;
		this.z = z;
		this.special = special;
	}

	public boolean hasGreaterOrEqualTo(int num) {
		return (x >= num || y >= num || z >= num);
	}

	@Override
	public String toString() {
		return "(" + x + ", " + y + ", " + z + ", " + special + ")";
	}

}
