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.BufferedReader;
import java.io.FileOutputStream;
import java.io.OutputStreamWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.Writer;

public class Googledance {
	public static void main (String[] args) {
		FileReader fr = null;
		BufferedReader br = null;
		Writer out = null;
		Writer debug = null;
		try {
			fr = new FileReader(args[0]);
			br = new BufferedReader(fr);
			out = new OutputStreamWriter(new FileOutputStream("googledance-result.txt"));
			debug = new OutputStreamWriter(new FileOutputStream("googledance-debug.txt"));
			String numOfLine = br.readLine();
			int line = 0;
			if (numOfLine != null) {
				line = Integer.valueOf(numOfLine);
			} else {
				return;
			}

			String lineData;
			String[] danceArray;

			for (int i = 1; i <= line; i++) {
				String resultLine = "";
				lineData = br.readLine();
				danceArray = lineData.split(" ");
				int numOfGoogler = Integer.valueOf(danceArray[0]);
				int numOfSurprise = Integer.valueOf(danceArray[1]);
				int minSingleScore = Integer.valueOf(danceArray[2]);

				int googlerTotalScore = 0;
				int okCounter = 0;
				int surpriseCounter = 0;
				int kOk = 0, lOk = 0, mOk = 0;
				boolean okNumber = false;
				boolean surpriseNumber = false;
				for (int j = 3; j < 3 + numOfGoogler; j++) {
					okNumber = false;
					surpriseNumber = false;
					kOk = 0; lOk = 0; mOk = 0;
					googlerTotalScore = Integer.valueOf(danceArray[j]);
					if (minSingleScore >=2) {
						for (int k = minSingleScore - 2; k <= 30; k++) {
							if (okNumber && !surpriseNumber) {
								break;
							}
							for (int l = minSingleScore - 2; l <= 30; l++) {
								if (okNumber && !surpriseNumber) {
									break;
								}
								for (int m = minSingleScore - 2; m <= 30; m++) {
									if ((k + l + m) == googlerTotalScore) {
										if (k >= minSingleScore || l >= minSingleScore || m >= minSingleScore) {
											if ((Math.abs(k - l) < 2) && (Math.abs(l - m) < 2) && (Math.abs(k - m) < 2)) {
												okNumber = true;
												kOk = k;
												lOk = l;
												mOk = m;
												surpriseNumber = false;
												break;
											} else if ((Math.abs(k - l) <= 2) && (Math.abs(l - m) <= 2) && (Math.abs(k - m) <= 2)) {
												okNumber = true;
												kOk = k;
												lOk = l;
												mOk = m;
												surpriseNumber = true;
											}
										}
									}
								}
							}
						}

						debug.write("break out at: " + kOk + " " + lOk + " " + mOk + " ok: " + okNumber + " surprise: " + surpriseNumber + "\n");

						if (okNumber) {
							okCounter++;
						}

						if (surpriseNumber) {
							surpriseCounter++;
						}
					} else if (minSingleScore == 1) {
						for (int k = minSingleScore - 1; k <= 30; k++) {
							if (okNumber && !surpriseNumber) {
								break;
							}
							for (int l= minSingleScore - 1; l <= 30; l++) {
								if (okNumber && !surpriseNumber) {
									break;
								}
								for (int m = minSingleScore - 1; m <= 30; m++) {
									if ((k + l + m) == googlerTotalScore) {
										if (k >= minSingleScore || l >= minSingleScore || m >= minSingleScore) {
											if ((Math.abs(k - l) < 2) && (Math.abs(l - m) < 2) && (Math.abs(k - m) < 2)) {
												okNumber = true;
												kOk = k;
												lOk = l;
												mOk = m;
												surpriseNumber = false;
												break;
											} else if ((Math.abs(k - l) <= 2) && (Math.abs(l - m) <= 2) && (Math.abs(k - m) <= 2)) {
												okNumber = true;
												kOk = k;
												lOk = l;
												mOk = m;
												surpriseNumber = true;
											}
										}
									}
								}
							}
						}

						debug.write("break out at: " + kOk + " " + lOk + " " + mOk + " ok: " + okNumber + " surprise: " + surpriseNumber + "\n");

						if (okNumber) {
							okCounter++;
						}

						if (surpriseNumber) {
							surpriseCounter++;
						}
					} else if (minSingleScore == 0) {
						for (int k = minSingleScore; k <= 30; k++) {
							if (okNumber && !surpriseNumber) {
								break;
							}
							for (int l= minSingleScore; l <= 30; l++) {
								if (okNumber && !surpriseNumber) {
									break;
								}
								for (int m = minSingleScore; m <= 30; m++) {
									if ((k + l + m) == googlerTotalScore) {
										if (k >= minSingleScore || l >= minSingleScore || m >= minSingleScore) {
											if ((Math.abs(k - l) < 2) && (Math.abs(l - m) < 2) && (Math.abs(k - m) < 2)) {
												okNumber = true;
												kOk = k;
												lOk = l;
												mOk = m;
												surpriseNumber = false;
												break;
											} else if ((Math.abs(k - l) <= 2) && (Math.abs(l - m) <= 2) && (Math.abs(k - m) <= 2)) {
												okNumber = true;
												kOk = k;
												lOk = l;
												mOk = m;
												surpriseNumber = true;
											}
										}
									}
								}
							}
						}

						debug.write("break out at: " + kOk + " " + lOk + " " + mOk + " ok: " + okNumber + " surprise: " + surpriseNumber + "\n");
						debug.write("\n");

						if (okNumber) {
							okCounter++;
						}

						if (surpriseNumber) {
							surpriseCounter++;
						}
					}
				}

				if (surpriseCounter > numOfSurprise) {
					okCounter = okCounter - (surpriseCounter - numOfSurprise);
				}

				resultLine = "Case #" + i + ": " + okCounter;

				debug.write("\n");
				out.write(resultLine);
				if (i != line) {
					out.write("\n");
				}
				System.out.println(resultLine);
			}
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		} catch (IOException e) {
			e.printStackTrace();
		} finally {
			try {
				br.close();
				fr.close();
				out.close();
				debug.close();
			} catch(Exception e) {}
		}
	}
}
