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.FileReader;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.StringTokenizer;


public class Dancing { 
	
	
 	public static void main(String[] arg) throws Exception {
 		Dancing pg = new Dancing();
	 
		 pg.go();
	}
 	
 	Dancing()
	{
 	 
 
	}
 	

 	private int addThisScore(int totalPoints, int p)
 	{
 		int avg = totalPoints / 3;
 		int low = Math.max(0,  avg - 2);
 		int high = Math.min(10, avg + 2);
 		int bestResult;
 		
 		int S, NS;
 		S = 0;
 		NS = 0;
 	
 		for(int i = low; i <=high; i++)
 		{
 			for(int j = low; j <=high; j++)
 	 		{
 				for(int k = low; k <=high; k++)
 		 		{
 		 			if((i + j + k) != totalPoints)
 		 				continue;
 		 			
 		 			if(Math.abs(i-j) > 2 || Math.abs(j-k) > 2 || Math.abs(i-k) > 2)
 		 				continue;
 		 			
 		 			bestResult = Math.max(Math.max(i, j),k);
 		 			if(bestResult < p)
 		 				continue;
 		 				
 		 			//System.out.println("Triplet = " +i +" "+j +" "+k);
 		 			
 		 			if(bestResult >= p)
 		 			{
 		 				//is this a surprising triplet
 		 				if(Math.abs(i-j) == 2 || Math.abs(j-k) == 2 || Math.abs(i-k) == 2)
 		 				{
 		 					S = 2;
 		 				}
 		 				else
 		 				   NS = 1;
 		 			}
 		 			
 		 		}
 	 			
 	 		}
 			
 		}
 		return S + NS;
 	}
 	public void go()
	{
 		String line = "";
			try {
			    BufferedReader in = new BufferedReader(new FileReader("B-large.in"));
			     
			    StringBuilder outString = new StringBuilder();
			    StringTokenizer tokens;
			    
	             
	            int caseNo = 0;
	             
	            int T = Integer.parseInt(in.readLine().trim());
	            int N, S, p, t;
	            int totalGooglers;
	            int totalSurprisingTriplets;
	            while(caseNo++ < T)
	            {
 	              line = in.readLine().trim();
 	              totalGooglers = 0;
 	              totalSurprisingTriplets = 0;
 	              tokens = new StringTokenizer(line);
 	              N = Integer.parseInt(tokens.nextToken().trim());
 	              S = Integer.parseInt(tokens.nextToken().trim()); //noof surprises
 	              p = Integer.parseInt(tokens.nextToken().trim());
 	              int res;
 	              while(N > 0)
 	              {
 	            	  t = Integer.parseInt(tokens.nextToken().trim());
 	            	// System.out.println("**** " + t +" ****");
 	            	  res = addThisScore(t, p);
 	            	 
 	            	  if(res != 0)
 	            	  {
 	            		  if(res == 2)
 	            		  {
 	            			  totalSurprisingTriplets++;
 	            		  }
 	            		  else
 	            		    totalGooglers++;
 	            	  }
 	            	  N--;
 	              }
 	              if(S < totalSurprisingTriplets)
 	              {
 	            	 totalSurprisingTriplets = S; 	            	  
 	              }
 	              
 	             totalGooglers +=  totalSurprisingTriplets;
            	  
 	             outString.append("Case #" + caseNo + ": " + totalGooglers); 	               
	             
	              outString.append("\n");
	            }
	  		    BufferedWriter pwr = new BufferedWriter(new FileWriter("output.txt"));
			    pwr.write(outString.toString());
			    pwr.close();		    
			    in.close();
			}
			catch (Exception e) 
			{
				e.printStackTrace();
				System.out.println("processing : " + line);
			}
	}
}
