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


/**
 * Write a description of class dancing here.
 * 
 * @author (your name) 
 * @version (a version number or a date)
 */
import java.io.*;

public class dancing
{
    public static void main(String args[]) throws IOException
    {
        int tcase,ng,sur,max;
        int i, j, m, x, y=0,s,flag=0,sum,best,counter;
        int g[]=new int[100];
        char ch,newline=13;
        String result;
        FileInputStream fis;
        
        fis = new FileInputStream("B-large.in");
        
    
    DataInputStream dis = new DataInputStream(fis);
  BufferedReader br = new BufferedReader(new InputStreamReader(dis));
  

  File fout = new File("B-large-sol.op");
  FileOutputStream fo = new FileOutputStream(fout);

  byte buf[];

  
  String strline;

  strline = br.readLine();
  
  tcase = Integer.parseInt(strline);
 // System.out.println(tcase);
  for(m=1;m<=tcase;m++)
    {   
//System.out.println("testcase"+m);
        s=0;
        ch=(char)br.read();
 //       cout<<ch<<endl;
        do
        {
        s= 10*s + (ch-48);
        ch=(char)br.read();
 //       cout<<s<<endl;
        }
        while(ch!='\n'&& ch!=' ');
        ng=s;
        
        s=0;
        ch=(char)br.read();
 //       cout<<ch<<endl;
        do
        {
        s= 10*s + (ch-48);
        ch=(char)br.read();
 //       cout<<s<<endl;
        }
        while(ch!='\n'&& ch!=' ');
        sur=s;
        
        s=0;
        ch=(char)br.read();
 //       cout<<ch<<endl;
        do
        {
        s= 10*s + (ch-48);
        ch=(char)br.read();
 //       cout<<s<<endl;
        }
        while(ch!='\n'&& ch!=' ');
        max=s;
        
       
  //System.out.println(ng+" "+sur+" "+max);      
    for(i=0;i<ng;i++)
     {
        s=0;
        ch=(char)br.read();
 //       cout<<ch<<endl;
        do
        {
        s= 10*s + (ch-48);
        ch=(char)br.read();
  //      System.out.println(ch-48);
 //       cout<<s<<endl;
        }
        while(ch!='\n'&& ch!=' ');
        g[i]=s;
        
     }
    // System.out.println("scores are read!!!"+g[ng-1]);
    counter=0;
    for(i=0;i<ng;i++)
        {
     //       System.out.println(g[i]);     
          if(g[i] < (max*3-4))
            continue;
     
          if(g[i]%3==0)
            best = g[i]/3;
          else
            best= (g[i]/3) +1;
            
          if(best>=max)
            {
 //             System.out.println("best"+best);
                counter++;  
            }
           else{
               if((max-(g[i]-max)/2) == 2 && sur > 0)
                    {//System.out.println("surprise");
                        counter++;
                        sur--;
                    }
               }
        }

    
        result= "Case #"+m+": "+counter+'\n';
  // System.out.println("Case #"+m+": "+counter);
        buf=result.getBytes();
       try{
           fo.write(buf);
        }
        catch(Exception e){System.out.println("hey");}
        
    
   }
    try{
        fo.close();
        fis.close();
    }
    catch(Exception e){}
}
}
