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

// Problem B

import java.io.File;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Locale;
import java.util.Scanner;

public class B {
	
	private void processInput() throws IOException {
		Scanner in = new Scanner(System.in);
		
		int T = in.nextInt();
		
		for (int testCase = 1; testCase <= T; testCase++) {
			int N = in.nextInt();
            int S = in.nextInt();
            int p = in.nextInt();
            int[] arr = new int[N];
            for (int j = 0; j < N; j++) {
                arr[j] = in.nextInt();
            }

			int res = go(N, S, p, arr);

			System.out.printf(Locale.ENGLISH, "Case #%d: %d\n", testCase, res);
		}
		
		in.close();
	}
	
	private int go(int N, int S, int p, int[] arr) {
		
        int res = 0;
        int s = S;
	    
	    for (int i = 0; i < N; i++) {
	        int rr = -1;
	        for (int P = p; P <= 10; P++) {
    	        int diff = arr[i] - P;
    	        if (diff >= 0) {
    	            int v1 = diff / 2;
    	            int v2 = diff - v1;
    	            if (P >= v1 && P >= v2) {
    	                if (P - v1 <= 1 && P - v2 <= 1) {
    	                    rr = 0;
    	                } else if (P - v1 <= 2 && P - v2 <= 2) {
    	                    if (rr == -1) {
    	                        rr = 1;
    	                    }
    	                }
    	                
    	            }
    	        }
	        }
	        if (rr == 0) {
	            res++;
	        } else if (rr == 1 && s > 0) {
	            s--;
	            res++;
	        }
	    }
	    
		return res;
	}
	
	
	public static void main(String[] args) throws Exception {
		B temp = new B();
		temp.processInput();
	}
}
