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

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package dancing;
import java.io.*; 
import java.util.*; 

/**
 *
 * @author Ewka
 */
public class Dancing {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        FileReader fr=null;
        PrintWriter fw=null;
        BufferedReader br;
        int noOfLines=0;  
        int noOfGooglers=0;
        int noOfSurprising=0;
        int noOfOut=0;
        int p=0;
        int noOfUsedSurp=0;
        
        String[] temp;
        
        try
        {
            fw = new PrintWriter ("outputDancingPro.txt");
        }
        catch(Exception e)
        {
            System.out.print("nie udalo sie");
        }
        
        try
        {
            fr = new FileReader("B-large.txt");            
        }
        catch(FileNotFoundException e)
        {
               System.out.println(e.getMessage());
        }
        br = new BufferedReader(fr);
        String s;
        try{
                s=br.readLine();            
                noOfLines = Integer.parseInt(s);           
                for (int i=0;i<noOfLines;i++)
                {        
                     System.out.print("Case #"+(i+1)+": ");
                     fw.print("Case #"+(i+1)+": ");
                     noOfOut = 0;
                     noOfUsedSurp=0;
                     s=br.readLine();
                     temp = s.split(" ");
                     noOfGooglers = Integer.parseInt(temp[0]);
                     int[] Scores = new int[noOfGooglers];
                     noOfSurprising = Integer.parseInt(temp[1]);
                     p = Integer.parseInt(temp[2]);
                     for (int j=0;j<noOfGooglers;j++)
                     {
                         Scores[j] = Integer.parseInt(temp[j+3]);
                     }
                     
                     Arrays.sort(Scores);
                     for (int j=noOfGooglers-1;j>=0;j--)
                     {
                        if (p==0)
                        {
                            noOfOut=noOfGooglers;
                            break;
                        }
                        else if (Scores[j] == 0)
                            continue;
                        if (Scores[j]/3 >= p)
                        {
                                noOfOut++;
                        }
                        else if (Scores[j] >= (p+(p-2)+(p-2)))
                        {
                              if ((p+(p-1)+(p-1) == Scores[j]) ||  (p+(p)+(p-1) == Scores[j]))
                              {
                                  noOfOut++;
                              }
                              else if (noOfUsedSurp < noOfSurprising)
                              {
                                  if ((p+(p-2)+(p-2) == Scores[j]) ||  (p+(p-2)+(p-1) == Scores[j]))
                                  {
                                        noOfOut++;
                                        noOfUsedSurp++;
                                  }
                              }
                        }
                        else
                        {
                            break;
                        }
                     }
                     System.out.println(noOfOut);
                     fw.print(noOfOut);
                     fw.println();
                     
                }
                fr.close();
                fw.close();
        }
        catch(Exception e)
        {
            
        }
            
    }
}
