package code12.qualification;

import java.io.File;
import java.io.FileWriter;
import java.util.Scanner;

public class B {
	public static String solve(int N, int S, int p, int[] t) {
		
		// 3a 		-> (a, a, a), *(a - 1, a, a + 1)
		// 3a + 1	-> (a, a, a + 1), *(a - 1, a + 1, a + 1)
		// 3a + 2	-> (a, a + 1, a + 1), *(a, a, a + 2)
		
		int numPNoS = 0;
		int numPWithS = 0;
		
		for (int i = 0; i < N; i++) {
			int a = (int)Math.floor(t[i] / 3);
			int r = t[i] % 3;
			
			switch (r) {
			case 0:
				if (a >= p) {
					numPNoS++;
				} else if (a + 1 >= p && a - 1 >= 0) {
					numPWithS++;
				}
				break;
			case 1:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				}
				break;
			case 2:
				if (a >= p || a + 1 >= p) {
					numPNoS++;
				} else if (a + 2 >= p) {
					numPWithS++;
				}
				break;
			}
		}
		
		return "" + (numPNoS + Math.min(S, numPWithS));
	}

	public static void main(String[] args) throws Exception {
		// file name
		//String fileName = "Sample";
		//String fileName = "B-small";
		String fileName = "B-large";
		
		// file variable
		File inputFile = new File(fileName + ".in");
		File outputFile = new File(fileName + ".out");
		Scanner scanner = new Scanner(inputFile);
		FileWriter writer = new FileWriter(outputFile);

		// problem variable
		int totalCase;
		int N, S, p;
		int[] t;

		// get total case
		totalCase = scanner.nextInt();

		for (int caseIndex = 1; caseIndex <= totalCase; caseIndex++) {
			// get input
			N = scanner.nextInt();
			S = scanner.nextInt();
			p = scanner.nextInt();
			t = new int[N];
			
			for (int i = 0; i < N; i++) {
				t[i] = scanner.nextInt();
			}
			
			String output = "Case #" + caseIndex + ": " + solve(N, S, p, t);
			System.out.println(output);
			writer.write(output + "\n");
		}
		scanner.close();
		writer.close();
	}
}

import java.util.Scanner;
import java.io.File;

public class ScoreAnalyzer
 {
 	
 	public void analyzeInputFile(String fileName) throws Exception
 	 {
	   Scanner fileScanner = new Scanner (new File (fileName) ); 	
 	   
 	   String line;
 	   
 	   line = fileScanner.nextLine();
 	   
 	   int numberOfTestCases = Integer.parseInt(line.trim());
 	   
 	   int N,S,p;
 	   
 	   for(int i = 1; i<= numberOfTestCases ; i++)
 	    { 
 	       line = fileScanner.nextLine();	
 	       	 	
 	       Scanner lineScanner = new Scanner(line);
 	       
 	       N = Integer.parseInt(lineScanner.next().trim());
 	       S = Integer.parseInt(lineScanner.next().trim());
 	       p = Integer.parseInt(lineScanner.next().trim());
 	       
 	       // System.out.println("N= "+N+ " S = "+S + " p = "+p); 
 	       
 	       int noSurpriseLowerLimitScore;
 	       int surpriseLowerLimitScore;
 	       int surpriseHigherLimitScore;
 	       
 	       noSurpriseLowerLimitScore = 3*p - 2;
 	       surpriseLowerLimitScore   = 3*p - 4;
 	       surpriseHigherLimitScore  = 3*p - 3;
 	       
 	      // System.out.println("3p-2 = "+noSurpriseLowerLimitScore);
 	      // System.out.println("3p-4 = "+surpriseLowerLimitScore);
 	      // System.out.println("3p-3 = "+surpriseHigherLimitScore);
 	       
 	       
 	       int googlersWithBestResultOfAtLeastP = 0;
 	       int numberOfSurpriseScoresLeft = S;
 	       
 	       for(int j=1; j<=N ; j++)
 	        {
 	          int googlerScore = Integer.parseInt(lineScanner.next().trim());
 	          
 	          if(googlerScore >= p)
 	          {
 	          
 	           //  System.out.println("googlerScore = "+googlerScore+" ");
 	          
 	             if(googlerScore >= noSurpriseLowerLimitScore) 
 	              {
 	           	    googlersWithBestResultOfAtLeastP++;
 	           	    continue;
 	              }
 	           
 	             if(numberOfSurpriseScoresLeft > 0 )
 	              {
 	                if(googlerScore >= surpriseLowerLimitScore && googlerScore <= surpriseHigherLimitScore) 
 	                 {
 	              	   googlersWithBestResultOfAtLeastP++;
 	              	   numberOfSurpriseScoresLeft--;
 	                 } 	
 	              } 
 	           }
 	         } 
 	       
 	       System.out.println("Case #"+i+": "+googlersWithBestResultOfAtLeastP);
 	    }
 	 }
 	
 	
 	
    public static void main(String[] args) throws Exception
     {
     	ScoreAnalyzer SA = new ScoreAnalyzer();
     	String inputFile = "B-large.in";
     	
     	SA.analyzeInputFile(inputFile);
     }	
 }