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.*;
/**
 *
 * @author ankush
 */
public class Main {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args)throws IOException {
        //System.out.println(Math.floor(Math.log10(11)));
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        int t=Integer.parseInt(br.readLine());
        int ans[]=new int[t];
        for(int i=0;i<t;i++)
        {
            String x=br.readLine();
            String r[]=new String[250];
            r=x.split(" ");
            int n=Integer.parseInt(r[0]);
            int s=Integer.parseInt(r[1]);
             int p=Integer.parseInt(r[2]);
            int count=0;
            int arr[]=new int[n];
            for(int j=0;j<n;j++)
            {
                arr[j]=Integer.parseInt(r[j+3]);
            }
            int pos[]=new int[n];
            for(int j=0;j<n;j++)
            {
                int max=0,a=0,b=0,c=0;
                for(a=p;a<11;a++)
                {
                     for(b=0;b<11;b++)
                    {
                        c=(arr[j]-a-b);
                        if(c>=0 && Math.abs(a-b)<2 && Math.abs(a-c)<2 && Math.abs(c-b)<2)
                        {
                           max=Math.max(a, b);
                           max=Math.max(max,c);
                           if(max >= p && pos[j]!=1)
                           {
                               count++;
                               pos[j]=1;
                           //  System.out.println(arr[j]+" "+a+" "+b+" "+c);
                             a=100;b=100;
                            break;
                           }
                        }
                     }
                }
                if(a==11)
                {
                for(a=p;a<11;a++)
                {
                     for(b=0;b<11;b++)
                    {
                        c=(arr[j]-a-b);
                        if(c>=0 && Math.abs(a-b)<3 && Math.abs(a-c)<3 && Math.abs(c-b)<3)
                        {
                           max=Math.max(a, b);
                           max=Math.max(max,c);
                           if(max >= p && s>0 && pos[j]!=1)
                           {
                               s--;
                               count++;
                               pos[j]=1;
                             // System.out.println(arr[j]+" "+a+" "+b+" "+c+" "+s);
                             a=11;b=11;
                             break;
                           }
                        }
                    }
                }
                }

            }/*
              if(s>0)
                {
              for(int j=0;j<n;j++)
                {
                  if(pos[j]==1)
                  {
                 int max=0,a=0,b=0,c=0;
                for(a=0;a<11;a++)
                {
                     for(b=0;b<11;b++)
                    {
                        c=(arr[j]-a-b);
                        if(c>=0 && Math.abs(a-b)==2 || Math.abs(a-c)==2 || Math.abs(c-b)==2)
                        {
                           max=Math.max(a, b);
                           max=Math.max(max,c);
                           if(max >= p && pos[j]==1)
                           {
                               s--;
                            //  System.out.println(arr[j]+" "+a+" "+b+" "+c);
                             a=100;b=100;
                             break;
                           }
                        }
                     }
                }
                    }
                }
              }*/
            ans[i]=count;
           //System.out.println(x+" "+ans[i]+" "+s);
            
    }
 for(int i=0;i<t;i++)
        {
            System.out.println("Case #"+(i+1)+": "+ans[i]);
        }
}
}