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.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.LinkedList;


public class DancingWiththeGooglers 
{
	int maxWiner =0;
	LinkedList<Integer> x = new LinkedList<Integer>();
	ArrayList<Integer> answer = new ArrayList<Integer>();
	
	public DancingWiththeGooglers()
	{
		
	}
	
	public void solve(int[] given)
	{
		int maxNumberOfSur = given[1];
		for(int i=3;i<given.length;i++)
		{
			int min= given[i]/3;
			int rest = given[i] %3;
			if(min>= given[2])
			{
				maxWiner++;
			}
			else if(rest ==1)
			{
				if(min+rest>=given[2])
				{
					maxWiner++;
				}
			}
			else if(rest ==2)
			{
				x.add(min);
			}
		}
		int use = 1;
		if(maxNumberOfSur!=0)
		{
			for(int i=0;i<x.size();i++)
			{	
				if(x.get(i)+2>=given[2] && use<=maxNumberOfSur)
				{
					maxWiner++;
					use++;
				}
			}
		}
		else
		{
			for(int i=0;i<x.size();i++)
			{
				if(x.get(i)+1>=given[2])
				{
					maxWiner++;
				}
			}
		}
		answer.add(maxWiner);
		x=new LinkedList<Integer>();
		maxWiner=0;
	}

	
	public void write()
	{
		try{
	    	  // Create file 
	    	  FileWriter fstream = new FileWriter("out.txt");
	    	  BufferedWriter out = new BufferedWriter(fstream);
	    	  int m=0;
	    	  for(int i=0;i<answer.size();i++)
	    	  {
	    		  m=i;
	    		  out.write("Case #"+(m+1)+": "+answer.get(i));
	    		  if(i!=answer.size()-1)
	    		  out.newLine();
	    	  }
	    		  
	    	  //Close the output stream
	    	  out.close();
	    	  }catch (Exception e){//Catch exception if any
	    	  System.err.println("Error: " + e.getMessage());
	    	  }  
	}
	
	public void answer()
	{
		
		try{
			  // Open the file that is the first 
			  // command line parameter
			  FileInputStream fstream = new FileInputStream("input.txt");
			  // Get the object of DataInputStream
			  DataInputStream in = new DataInputStream(fstream);
			  BufferedReader br = new BufferedReader(new InputStreamReader(in));
			  String strLine = br.readLine();
			  //Read File Line By Line
			  
			  while ((strLine = br.readLine()) != null)   {
			  // Print the content on the console
				  
				 String[] k = strLine.split(" ");
				 int[]u = new int[k.length];
				 for(int i=0;i<k.length;i++)
				 {
					 if(k[i]!=""||k[i]!=" ")
					 u[i]=Integer.parseInt(k[i]);
				 }
				 solve(u);
			  }
			  //Close the input stream
			  in.close();
			    }catch (Exception e){//Catch exception if
			  System.err.println("Error: " + e.getMessage());
			  }
			  write();
	}

    public static void main(String[] args) {
		DancingWiththeGooglers p=new DancingWiththeGooglers();
		p.answer();
		
	}


}
