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;


public class Googlers_Dance {
	
	FileWriter fstream;
	BufferedWriter out;
	
	Googlers_Dance()
	{
		try 
		{
		fstream = new FileWriter("E:\\Yoxos\\EclipseNew\\workspace\\TestProject\\Dance_op.txt");
		out = new BufferedWriter(fstream);
		
		}catch (Exception e){//Catch exception if any
		  System.err.println("Error: " + e.getMessage());
		}
	}

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		
		Googlers_Dance obj = new Googlers_Dance();
		obj.getInput();
		
		 //Close the output stream
		  //out.close();
	}
	
	void printFile(String strLine)
	{
		try{
			  // Create file 
			  
			  out.write(strLine);
			 
			  }catch (Exception e){//Catch exception if any
			  System.err.println("Error: " + e.getMessage());
			  }
	}
	
	void getInput()
	{
	try{
	    // Open the file that is the first 
	    // command line parameter
		int iNumberOfLines = 0 ;
	    FileInputStream fstream = new FileInputStream("E:\\Yoxos\\EclipseNew\\workspace\\TestProject\\src\\B-large.in");
	    // Get the object of DataInputStream
	    DataInputStream in = new DataInputStream(fstream);
	    BufferedReader br = new BufferedReader(new InputStreamReader(in));
	    
	    String strLine;
	    //Read File Line By Line
	    if ((strLine = br.readLine()) != null)   {
	      // Print the content on the console
	      //System.out.println (""+strLine);
	      iNumberOfLines = Integer.parseInt(strLine);
	    }
	    int j=1;
	    while(iNumberOfLines-- > 0 && ((strLine = br.readLine())!=null))
	    {
   	
	    	int iTempCount = getGooglersBestNumber(strLine);
	    	String strTemp= "Case #"+j+": "+iTempCount;
	    	
	    	System.out.println(strTemp);
	    	j++;
	    }
	    //Close the input stream
	    in.close();
	    }catch (Exception e){//Catch exception if any
	    	e.printStackTrace();
	    }  
	}
	
	int getGooglersBestNumber(String strLine)
	{
		int iGooglersBestCount=0;
    	String strWords[] = strLine.split(" ");
    	int iN = Integer.parseInt(strWords[0]);
    	int iSurprising = Integer.parseInt(strWords[1]);
    	int iP = Integer.parseInt(strWords[2]);
    	
    	int  l=3,k=0;
    	
    	while(l < strWords.length) {
    		k=iP;
    		int iT = Integer.parseInt(strWords[l++]);
    		
    		while(k>=0 && k<=10)
    		{
    			int iTempMaxVal = (k*3);
    			if(iT >= iTempMaxVal) {
    				
    				if((iT==iTempMaxVal) || (iT == iTempMaxVal+1) || (iT == iTempMaxVal+2)) {
						
    					iGooglersBestCount++;
    					break;
    				}   
                  
    				if(iSurprising>0) {
    					
    					if((iT == iTempMaxVal+3)  || (iT == iTempMaxVal+4)) {
    						iSurprising--;
    						iGooglersBestCount++;
    						break;
    					}
    				}
    				
    				 				
    				k++;
    			}
    			else {
    				
    				if(iT <= iTempMaxVal) {
    					
    					if((iT==iTempMaxVal) || (iT == iTempMaxVal-1) || (iT == iTempMaxVal-2)) {
        					iGooglersBestCount++;
        					break;        			
        				}
    	                  
        				if(iSurprising>0) {
        					
        					if(iT!=0 && (iT == iTempMaxVal-3) || (iT == iTempMaxVal-4)) {
        						iGooglersBestCount++;
        						iSurprising--;
        						break;
        					}
        				}
        				
        				break;
        			}    			
    				
    			}
    		}
    	}
    	
		return iGooglersBestCount;
	}
}
