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 Q2
{
	private static int max (int a, int b, int c)
	{
		return Math.max (a, Math.max (b, c));
	}
	
	public static void main (String[] args) throws IOException
	{
		BufferedReader reader = new BufferedReader (new FileReader ("input-q2.txt"));
		PrintWriter writer = new PrintWriter ("output-q2.txt");
		String line = reader.readLine();
		int nb = Integer.parseInt (line);
		for (int i = 0; i < nb; i++)
		{
			line = reader.readLine();
			String[] tokens = line.split (" ");
			int[] googlers = new int[Integer.parseInt (tokens[0])];
			int s = Integer.parseInt (tokens[1]);
			int p = Integer.parseInt (tokens[2]);
			for (int j = 0; j < googlers.length; j++)
			{
				googlers[j] = Integer.parseInt (tokens[3 + j]);
			}
			
			System.out.printf ("\ns : %d,  p : %d, googlers : %s\n", s, p, Arrays.toString (googlers));
			
			// For each googler
			int counter = 0;
			for (int j = 0; j < googlers.length; j++)
			{
				System.out.print ("Googler " + googlers[j] + " :");
				int a = 0, b = 0, c = 0;
				
				if ((googlers[j] - 2) % 3 == 0)
				{
					a = b = (googlers[j] - 2) / 3;
					c = (googlers[j] - 2) / 3 + 2;
					
					if (max (a, b + 1, c - 1) >= p || c <= 1 || max (a, b, c) < p)
					{
						System.out.printf ("  (%d %d %d)\n", a, b + 1, c - 1);
						if (max (a, b + 1, c - 1) >= p)
						{
							counter++;
						}
						continue;
					}
					else if (s > 0)
					{
						s--;
						if (max (a, b, c) >= p)
						{
							counter++;
						}
						System.out.printf ("  (%d %d %d) *\n", a, b, c);
						continue;
					}
					else
					{
						System.out.println ("ERROR");
					}
				}
				
				if ((googlers[j] - 1) % 3 == 0)
				{
					a = b = (googlers[j] - 1) / 3;
					c = (googlers[j] - 1) / 3 + 1;
					
					if (max (a, b, c) >= p)
					{
						counter++;
					}
					System.out.printf ("  (%d %d %d)\n", a, b, c);
					continue;
				}
				
				if (googlers[j] % 3 == 0)
				{
					a = b = c = googlers[j] / 3;
					
					if (max (a, b, c) >= p || b <= 1 || max (a, b - 1, c + 1) < p || s == 0)
					{
						System.out.printf ("  (%d %d %d)\n", a, b, c);
						if (max (a, b, c) >= p)
						{
							counter++;
						}
						continue;
					}
					else if (s > 0)
					{
						s--;
						if (max (a, b - 1, c + 1) >= p)
						{
							counter++;
						}
						System.out.printf ("  (%d %d %d) *\n", a, b - 1, c + 1);
						continue;
					}
					else
					{
						System.out.println ("ERROR");
					}
				}
			}
			System.out.println ("Counter : " + counter);
			writer.println ("Case #" + (i + 1) + ": " + counter);
		}
		writer.close();
		reader.close();
	}
}