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.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Comparator;
import java.util.Iterator;
import java.util.List;
import java.util.Scanner;

public class SolutionB_2 {

    public static void main(String[] args) throws IOException {

	String curDir = "DancingWithGooglers/";

	Scanner sc = new Scanner(new FileReader(curDir + "B-large.in"));
	PrintWriter pw = new PrintWriter(new FileWriter(curDir + "B-large.out"));

	int totalTestCase = Integer.parseInt(sc.nextLine());

	for (int testCase = 1; testCase <= totalTestCase; testCase++) {
	    Integer nGoogler = sc.nextInt();
	    Integer nSurprising = sc.nextInt();
	    Integer bestNum = sc.nextInt();

	    Integer maxNum = 0;
	    Integer nCheck = 0;

	    List<Integer> g = new ArrayList<Integer>();
	    List<Integer> g1 = new ArrayList<Integer>();

	    for (int i = 0; i < nGoogler; i++) {
		Integer a = sc.nextInt();
		g.add(a);
		g1.add(a);
	    }

	    if (nSurprising == 0) {
		for (Integer t : g) {
		    int y = t / 3;
		    int z = t % 3;

		    if (t == 0 || t == 1) {
			if (t >= bestNum) {
			    maxNum++;
			}
		    } else if (z == 0) {
			if (y >= bestNum) {
			    maxNum++;
			}
		    } else if (z == 1) {
			if (y + 1 >= bestNum) {
			    maxNum++;
			}
		    } else if (z == 2) {
			if (y + 1 >= bestNum) {
			    maxNum++;
			}
		    }
		}
	    } else {
		java.util.Collections.sort(g, new Comparator<Integer>() {
		    public int compare(Integer a, Integer b) {
			if (a > b) {
			    return 1;
			} else if (a < b) {
			    return -1;

			} else {
			    return 0;
			}
		    }
		});

		for (Iterator<Integer> it = g.iterator(); it.hasNext();) {
		    Integer t = it.next();

		    int y = t / 3;
		    int z = t % 3;

		    if (t == 0 || t == 1) {
			continue;
		    } else if (z == 0) {
			if (y + 1 >= bestNum && nCheck < nSurprising) {
			    maxNum++;
			    nCheck++;
			    it.remove();
			}
		    } else if (z == 1) {
			if (y + 1 >= bestNum && nCheck < nSurprising) {
			    maxNum++;
			    nCheck++;
			    it.remove();
			}
		    } else if (z == 2) {
			if (y + 2 >= bestNum && nCheck < nSurprising) {
			    maxNum++;
			    nCheck++;
			    it.remove();
			} else if (y + 1 >= bestNum && nCheck < nSurprising) {
			    maxNum++;
			    nCheck++;
			    it.remove();
			}
		    }
		}

		if (nCheck >= nSurprising) {
		    for (Integer t : g) {
			int y = t / 3;
			int z = t % 3;

			if (t == 0 || t == 1) {
			    if (t >= bestNum) {
				maxNum++;
			    }
			} else if (z == 0) {
			    if (y >= bestNum) {
				maxNum++;
			    }
			} else if (z == 1) {
			    if (y + 1 >= bestNum) {
				maxNum++;
			    }
			} else if (z == 2) {
			    if (y + 1 >= bestNum) {
				maxNum++;
			    }
			}
		    }
		}

	    }

	    pw.println(String.format("Case #%d: %d", testCase, maxNum));
	    System.out.println(String.format("Case #%d: %d, %d, %s => %d", testCase, nSurprising, bestNum, g1.toString(), maxNum));
	}

	pw.flush();
	pw.close();
	sc.close();
    }
}
