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

package code.google.com;

import java.util.Scanner;

public class problemB {

	public static void main(String[] Args) {
		Scanner sc = new Scanner(System.in);
		int tests = sc.nextInt();
		int n, s, p;

		sc.nextLine();

		for (int i = 1; i <= tests; i++) {
			int t;
			int count = 0;
			int uCount = 0;
			n = sc.nextInt();
			s = sc.nextInt();
			p = sc.nextInt();

			for (int j = 1; j <= n; j++) {
				t = sc.nextInt();
				if (suprise(t) >= p && unsuprise(t) >= p)
					count++;
				else if (suprise(t) >= p)
					count++;
				else if (unsuprise(t) >= p)
					uCount++;
			}

			if (s < uCount)
				uCount = s;

			System.out.println("Case #" + i + ": " + (count + uCount));
			sc.nextLine();

		}

	}

	public static int max(int a, int b, int c) {
		int max = Integer.MIN_VALUE;

		if (a > max)
			max = a;
		if (b > max)
			max = b;
		if (c > max)
			max = c;

		return max;
	}

	public static int suprise(int t) {

		int dim;

		dim = t / 3;

		if (t == 0)
			return 0;
		if (t == 30)
			return 30;

		if (dim > 0) {
			int p;

			p = (dim + 1) + (dim + 1) + (dim);
			if (p == t)
				return max((dim + 1), (dim + 1), (dim));
			p = (dim + 1) + (dim) + (dim);
			if (p == t)
				return max((dim + 1), (dim), (dim));
			p = (dim) + (dim) + (dim);
			if (p == t)
				return max((dim), (dim), (dim));
			p = (dim - 1) + (dim) + (dim);
			if (p == t)
				return max((dim - 1), (dim), (dim));
			p = (dim - 1) + (dim - 1) + (dim);
			if (p == t)
				return max((dim - 1), (dim - 1), (dim));

		} else
			return 1;

		return -1;
	}

	public static int unsuprise(int t) {
		int dim;
		int p;

		dim = t / 3;

		if (t == 0)
			return 0;
		if (t == 30)
			return 30;

		if (dim > 1 && dim < 9) {

			p = (dim + 2) + (dim + 1) + (dim);
			if (p == t)
				return max((dim + 2), (dim + 1), (dim));
			p = (dim + 2) + (dim + 2) + (dim);
			if (p == t)
				return max((dim + 2), (dim + 2), (dim));
			p = (dim + 2) + (dim) + (dim);
			if (p == t)
				return max((dim + 2), (dim), (dim));
			p = (dim - 2) + (dim - 1) + (dim);
			if (p == t)
				return max((dim - 2), (dim - 1), (dim));
			p = (dim - 2) + (dim) + (dim);
			if (p == t)
				return max((dim - 2), (dim), (dim));
			p = (dim - 2) + (dim - 2) + (dim);
			if (p == t)
				return max((dim - 2), (dim - 2), (dim));
			p = (dim - 1) + (dim + 1) + (dim);
			if (p == t)
				return max((dim - 1), (dim + 1), (dim));

		}

		if (dim <= 1) {

			p = (dim + 2) + (dim) + (dim);
			if (p == t)
				return max((dim + 2), (dim), (dim));
			p = (dim + 2) + (dim + 2) + (dim);
			if (p == t)
				return max((dim + 2), (dim + 2), (dim));
			p = (dim + 2) + (dim + 1) + (dim);
			if (p == t)
				return max((dim + 2), (dim + 1), (dim));

			if (dim == 1) {
				p = (dim - 1) + (dim + 1) + (dim);
				if (p == t)
					return max((dim - 1), (dim + 1), (dim));
			}

		}

		if (dim >= 9) {

			p = (dim - 2) + (dim - 2) + (dim);
			if (p == t)
				return max((dim - 2), (dim - 2), (dim));
			p = (dim - 2) + (dim) + (dim);
			if (p == t)
				return max((dim - 2), (dim), (dim));
			p = (dim - 2) + (dim - 1) + (dim);
			if (p == t)
				return max((dim - 2), (dim - 1), (dim));

			if (dim == 9) {
				p = (dim - 1) + (dim + 1) + (dim);
				if (p == t)
					return max((dim - 1), (dim + 1), (dim));
			}

		}

		return -1;
	}
}
