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.File;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.HashMap;


public class Googlers {

	private static int testcases = 0;
	
	public static void main(String[] args)
	{
		String DataLine = "";
		int line = 0;
		PrintWriter out;
		
		try
		{
	      File inFile = new File("./config/B-small-attempt1.txt");
	      BufferedReader br = new BufferedReader(new InputStreamReader(
	          new FileInputStream(inFile)));
	      
	      out = new PrintWriter(new BufferedWriter(new FileWriter("./config/out3" + ".txt")));
         
	      while((DataLine = br.readLine()) != null)
	      {
	   
	    	  if(line == 0)
	    	  {
	    		  testcases = Integer.parseInt(DataLine.trim());
	    		  line++;
	    	  }
	    	  else
	    	  {
	    		  if(line<=testcases)
	    		  {
	    			  String[] datas = DataLine.split(" ");
	    			 
	    			  int N = Integer.parseInt(datas[0]);
	    			  int S = Integer.parseInt(datas[1]);
	    			  int P = Integer.parseInt(datas[2]);
	    			  int[] pnts = new int[N];
	    			  for(int i=0;i<N;i++)
	    				  pnts[i] = Integer.parseInt(datas[2+i+1]);
	    			  
	    			  int reslt = getResult(N, S,P,pnts);
	    			  out.write("Case #"+line+": "+reslt+"\n");
	    			  System.out.println("Case #"+line+": "+reslt+"\n");
	    			  line++;
	    		  }
	    		 
	    	  }
	    	
	      }
	      
	      br.close();
	      out.close();
	      
		}
		catch(FileNotFoundException fe)
		{
			fe.printStackTrace();
		}
		catch(IOException ie)
		{
			ie.printStackTrace();
		}
		
		
	}
	
	private static int getResult(int N,int S,int P,int[] pnts)
	{
		int resCount = 0;
		int temp = 0;
		
		System.out.println("N:S:P::"+N+":"+S+":"+P);
		
		if(P==0)
			return N;
		
		for(int j=0;j<N;j++)
		{
			int check = pnts[j];
			if(temp < S && P > 1)
			{
	
				if(((P-2)*3)+2 <= check )
				{
					resCount++;
					
					if(((P-2)*3)+2 == check || ((P-2)*3)+2 == check-1)
						temp++;
				}
			}
			else
			{
				if(((P-1)*3)+1 <= check )
					resCount++;
			}
		}
		return resCount;
	}
}
