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.File;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

public class Googlerese {
	
	static Scanner in;
	static PrintWriter out;
	        
	public static void fillDictionary(Map<Character,Character> dic){
		dic.put(new Character('a'), new Character('y'));
		dic.put(new Character('b'), new Character('n'));
		dic.put(new Character('c'), new Character('f'));
		dic.put(new Character('d'), new Character('i'));
		dic.put(new Character('e'), new Character('c'));
		dic.put(new Character('f'), new Character('w'));
		dic.put(new Character('g'), new Character('l'));
		dic.put(new Character('h'), new Character('b'));
		dic.put(new Character('i'), new Character('k'));
		dic.put(new Character('j'), new Character('u'));
		dic.put(new Character('k'), new Character('o'));
		dic.put(new Character('l'), new Character('m'));
		dic.put(new Character('m'), new Character('x'));
		dic.put(new Character('n'), new Character('s'));
		dic.put(new Character('o'), new Character('e'));
		dic.put(new Character('p'), new Character('r'));
		dic.put(new Character('q'), new Character('z'));
		dic.put(new Character('r'), new Character('p'));
		dic.put(new Character('s'), new Character('d'));
		dic.put(new Character('t'), new Character('r'));
		dic.put(new Character('u'), new Character('j'));
		dic.put(new Character('v'), new Character('g'));
		dic.put(new Character('w'), new Character('t'));
		dic.put(new Character('x'), new Character('h'));
		dic.put(new Character('y'), new Character('a'));
		dic.put(new Character('z'), new Character('q'));
	}
	
	public static String translate(String originalWord, Map<Character,Character> dic){
		String translatedWord="";
		for(int i = 0; i < originalWord.length(); i++){
			translatedWord += dic.get(originalWord.charAt(i));
		}
		
		return translatedWord;
	}

	public static void main(String[] args) throws Exception {
		in = new Scanner(new File("A-small.txt"));
		out = new PrintWriter(new File("output.txt"));

		Map<Character,Character> dic = new HashMap<Character, Character>();
		fillDictionary(dic);
		//Read file
		String Y = null;
		String[] originalWords;
		int T = in.nextInt();
		//for each case do
		for (int i = 0; i < T; i++){
			//get first O and first B buttons
			Y = in.nextLine();
			originalWords = Y.split(" ");
			System.out.print("Case " + i + ":");
			for(int j = 0; j < originalWords.length; j++){
				System.out.print(				translate(originalWords[j],dic))
			}
			
		}
		
	    out.print(Y);
	    //printf("Case #%d: %s%n", cas, ans);

		out.close();	
	}
}