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.Arrays;
import java.util.Scanner;


public class B {

	int N;
	int S;
	int p;
	int[] A = new int[100];
	
	int[][] memo = new int[100][100];
	
	boolean[][] normal = new boolean[11][31];
	boolean[][] surprise = new boolean[11][31];
	
	B() {
		for (int a=0; a<=10; ++a) {
			for (int b=a; b<=10 && b<=a+2; ++b) {
				for (int c=b; c<=10 && c<=a+2; ++c) {
					if (c-a<=1)
						normal[c][a+b+c]=true;
					else
						surprise[c][a+b+c]=true;
				}
			}
		}
		
		Scanner in=new Scanner(System.in);
		for (int T=in.nextInt(),TC=1; T-->0; ++TC) {
			N=in.nextInt();
			S=in.nextInt();
			p=in.nextInt();
			for (int i=0; i<N; ++i)
				A[i]=in.nextInt();
			for (int[] m : memo)
				Arrays.fill(m, -1);
			System.out.printf("Case #%d: %d%n",TC,go(0,0));
		}
	}
	
	int go(int at, int sur) {
		if (at==N)
			return 0;
		if (memo[at][sur]>-1)
			return memo[at][sur];
		
		int res=0;
		for (int max=0; max<=10; ++max) {
			int add=max>=p?1:0;
			if (normal[max][A[at]])
				res=Math.max(res,add+go(at+1,sur));
			if (sur<S && surprise[max][A[at]])
				res=Math.max(res,add+go(at+1,sur+1));
		}
		return memo[at][sur]=res;
	}
	public static void main(String[] args) {
		new B();
	}

}
