import java.io.BufferedWriter;
import java.io.File;
import java.io.FileOutputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.Scanner;


public class Dancing_With_the_Googlers {


    /**
     * The first line of the input gives the number of test cases, T.
     *  T test cases follow. 
     *  Each test case consists of a single line containing integers separated by single spaces. 
     *  The first integer will be N, the number of Googlers, and the second integer will be S, the number of surprising triplets of scores. 
     *  The third integer will be p, as described above. Next will be N integers ti: the total points of the Googlers. 
     * @throws IOException
     */
	   public static void main(String[] args) throws IOException {
	        // TODO Auto-generated method stub
			// Reading the input file
			Scanner in = new Scanner(new File("B-large.in"));
			// writting the input file
			FileOutputStream fos = new FileOutputStream("B-large.out");
			PrintStream out = new PrintStream(fos);
	         //Close the output stream
	        int testCase=Integer.parseInt(in.nextLine());
	        for(int i=0;i<testCase;i++) {
	        	out.print("Case #" + (i + 1) + ":\t");
	        	int NoOfGooglers= in.nextInt();
	        	int NoOfSurprisingResults = in.nextInt();
	        	int atLeastP=in.nextInt();
	        	ArrayList<Integer> scores= new ArrayList<Integer>();
        		int BestResults=0;
        		int Surprising=0;
	        	for(int j=0;j<NoOfGooglers;j++)
	        	{
	        		scores.add(in.nextInt());
	        		//System.out.print(scores.get(j));
	        		int modulus=scores.get(j)%3;
	        		int temp = scores.get(j);
	    			switch (modulus) {
					case 0:
						if (((temp / 3) >= atLeastP)) {
							BestResults++;
						} else {
							if (((((temp / 3) + 1) >= atLeastP) && ((temp / 3) >= 1))
									&& (Surprising < NoOfSurprisingResults)) {
								BestResults++;
								Surprising++;
								
							}
							System.out.println("Case 0"+"itr:"+i+"  surprising:"+temp);
						}
						
						break;
					case 1:
						if ((temp / 3) + 1 >= atLeastP) {
							BestResults++;
							continue;
						}
						
						break;
					case 2:
						if ((temp / 3) + 1 >= atLeastP) {
							BestResults++;
						} else {
							if (((temp / 3) + 2 >= atLeastP)
									&& (Surprising < NoOfSurprisingResults)) {
								BestResults++;
								Surprising++;
							}
							System.out.println("Case 2"+"itr:"+i+"  surprising:"+temp);
						}
						break;
					default:
						System.out.println("Error");
					}
	    			
				}// Internal for
				out.println(BestResults);
				// System.out.println(BestResults);
				System.out.println(Surprising);
				BestResults = 0;
			}// for
			in.close();
			out.close();
			fos.close();

	   }
}

import java.io.*;
import java.util.*;

public class codejam2 {
	
	static class triplet {
		
		int a, b, c;
		int maxdiff;
		
		public triplet(int pa, int pb, int pc) {
			a = pa;
			b = pb;
			c = pc;
			maxdiff = maxdiff();
			if (pa < 0 || pb < 0 || pc < 0) maxdiff = 3;
		}
		
		public boolean isSurprising() {
			return Math.abs(a-b) == 2 || Math.abs(a-c) == 2 || Math.abs(b-c) == 2;
		}
		
		public int maxdiff() {
			return Math.max(Math.abs(a-c), Math.max(Math.abs(a-b), Math.abs(b-c)));
		}
	}

	public static void main(String[] args) throws IOException {
		BufferedReader f = new BufferedReader(new FileReader("B-small-attempt0.in"));
		int T;
		
		T = Integer.parseInt(f.readLine());
		StringTokenizer t;
		
		for (int q = 0; q < T; q++) {
			int N, S, p;
			triplet[] ts;
			boolean[] sat;
			t = new StringTokenizer(f.readLine());
			N = Integer.parseInt(t.nextToken());
			S = Integer.parseInt(t.nextToken());
			p = Integer.parseInt(t.nextToken());
			ts = new triplet[N];
			sat = new boolean[N];
			int surpcount = 0;
			for (int i = 0; i < N; i++) {
				int n = Integer.parseInt(t.nextToken());
				int diff = n - (3 * (n/3));
				if (diff == 0 || diff == 1) {
					ts[i] = new triplet(n/3, n/3, n/3 + diff);
				}
				if (diff == 2) {
					ts[i] = new triplet(n/3, n/3+1, n/3+1);
				}
			}
			
			for (int i = 0; i < N; i++) {
				if (ts[i].c >= p) {
					sat[i] = true;
					continue;
				}
				
				triplet newtrip = new triplet(ts[i].a, ts[i].b-1, ts[i].c+1);
				if (newtrip.maxdiff == 1 && (newtrip.c >= p)) {
					sat[i] = true;
					continue;
				}
				if (surpcount >= S) continue;
				
				if (newtrip.maxdiff == 2 && (newtrip.c >= p)) {
					sat[i] = true;
					surpcount++;
					continue;
				}
				
				triplet newnewtrip = new triplet(ts[i].a - 1, ts[i].b-1, ts[i].c+2);
				if (newnewtrip.maxdiff == 2 && (newtrip.c >= p)) {
					sat[i] = true;
					continue;
				}
				
			}
			int tot = 0;
			for (int i = 0; i < N; i++) {
				if (sat[i]) {
					tot++;
				}
			}
			System.out.println("Case #" + (q+1) + ": " + tot);
		}
	}

}
