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();
	}
}

package Test1;


import java.io.BufferedReader;
import java.io.InputStreamReader;




public class Test1 {

	static String[] orig = {"ejp mysljylc kd kxveddknmc re jsicpdrysi", "rbcpc ypc rtcsra dkh wyfrepkym veddknkmkrkcd","de kr kd eoya kw aej tysr re ujdr lkgc jv"};
	static String[] target = {"our language is impossible to understand","there are twenty six factorial possibilities","so it is okay if you want to just give up"};
	static int[] map = new int[26];
	static int[] hash = new int[26];
	public static void main(String[] args) {

    int n,s,p,T;
    int[] t = new int[31]; 
    BufferedReader in = new BufferedReader(new InputStreamReader(System.in)) ;
    try {
    	
    	String str = in.readLine();
    	int result,vaildp,tempmax;
    	n = Integer.parseInt(str.trim());
    	for (int i = 1; i <= n; i++) {
    		str = in.readLine();
    		String[] temp = str.split(" ");
    		T = Integer.parseInt(temp[0]);
    		s = Integer.parseInt(temp[1]);
    		p = Integer.parseInt(temp[2]);
    		result = 0;
    		vaildp = 0;
    		for (int j=3; j<temp.length;j++){
    			int numtemp = Integer.parseInt(temp[j]);
    			int max = numtemp / 3;
    			if (numtemp % 3 != 0) max++;
    			if (max >= p) result++;
    			else {
    				tempmax = numtemp / 3;
    				if (numtemp % 3 == 1) tempmax = tempmax +1;
    				else if (numtemp % 3 == 2) tempmax = tempmax +2;
    				else if (tempmax > 0) tempmax = tempmax + 1;
    				if (tempmax >= p) vaildp++;
    			}
    			//System.out.println("num="+numtemp+";max="+max+";vild="+vaildp);
    		}
    		if (vaildp > s) vaildp = s;
    		result = result + vaildp;
    		if (result > T) result = T;
    		System.out.println("Case #"+i+": "+result);
    		//System.out.println("");
    	}
    } catch (Exception e) {
    	
    }
	}
}

