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 ponder.CodeJamQualify;

import java.io.*;
import java.util.StringTokenizer;

/**
 * @author: sg  Date: 15.04.12
 */
public class TaskB
{
	static int calc(final int p, final int strangeOrig, final int[] marks)
	{
		int cnt = 0;
		int strange = strangeOrig;
		for (int total : marks)
		{
			int max = total / 3;
			if ((total % 3) != 0)
				max += 1;

			if (max >= p)
			{
				cnt++;
				continue;
			}

			if (total <= 1)
				continue;

			if (((total % 3) != 1) && (strange > 0) && (max == p - 1))
			{
				cnt++;
				strange--;
			}
		}
		return cnt;
	}

	public static void main(String[] args) throws IOException
	{
		final long start = System.currentTimeMillis();

//		PrintWriter writer = new PrintWriter(new BufferedWriter(new FileWriter("taskB.out")));
//		BufferedReader reader = new BufferedReader(new FileReader("taskB.in"));

//		PrintWriter writer = new PrintWriter(new BufferedWriter(new FileWriter("B-small-attempt0.out")));
//		BufferedReader reader = new BufferedReader(new FileReader("B-small-attempt0.in"));

		PrintWriter writer = new PrintWriter(new BufferedWriter(new FileWriter("B-large.out")));
		BufferedReader reader = new BufferedReader(new FileReader("B-large.in"));

		String inLine;
		int caseIndex = 0;
		inLine = reader.readLine();
		while (null != (inLine = reader.readLine()))
		{
			StringTokenizer st = new StringTokenizer(inLine);
			final int n = Integer.parseInt(st.nextToken());
			final int s = Integer.parseInt(st.nextToken());
			final int p = Integer.parseInt(st.nextToken());
			int[] marks = new int[n];
			for (int i = 0; i < n; i++)
				marks[i] = Integer.parseInt(st.nextToken());
			caseIndex++;
			int cnt = calc(p, s, marks);
			writer.printf("Case #%d: %d\r\n", caseIndex, cnt);
		}

		writer.close();


		final long finish = System.currentTimeMillis();
		final long dur = finish - start;
		System.err.println(dur);
	}
}
