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.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.StringTokenizer;


public class Bversion2 {
	public static void main(String[] args) throws IOException {
		BufferedReader br=new BufferedReader(new FileReader("codejamb.in"));
		BufferedWriter brout=new BufferedWriter(new FileWriter("codejamb.out"));
		StringTokenizer sb=new StringTokenizer(br.readLine());
		int t=Integer.parseInt(sb.nextToken());
		int n;
		int p;
		int surprising;
		int[] values;
		for(int l=1;l<=t;l++) {
			sb=new StringTokenizer(br.readLine());
			n=Integer.parseInt(sb.nextToken());
			surprising=Integer.parseInt(sb.nextToken());
			p=Integer.parseInt(sb.nextToken());
			int result=0;
			values=new int[n];
			for(int i=0;i<n;i++) {
				values[i]=Integer.parseInt(sb.nextToken());
			}
		    for(int i=0;i<n;i++) {
		    	int x=calcifpossible(values[i],p);
		    	if(x==1) {
		    		
		    	}
		    	else if(surprising>0) {
		    		x=calcifSur(values[i],p);
		    		if(x==1)
		    		surprising--;
		    	}
		    	result+=x;
		    }
		
			brout.write("Case #"+l+": "+result+"\n");
		}
		brout.close();
		return;
	}
	public static int calcifpossible(int k,int p) {
		int kk=k%3;
		int ifnotsurprising=0;
		int num1not=0,num2not=0,num3not=0;
		switch(kk) {
		case 0:
			
				num1not=k/3;
				num2not=k/3;
				num3not=k/3;
			
			break;
		case 1:
			
				num1not=k/3;
				num2not=k/3;
				num3not=k/3+1;
			
		
			break;
		case 2:
			
			num1not=k/3;
			num2not=k/3+1;
			num3not=k/3+1;
			break;
		}
		if(num1not>=p) {
			ifnotsurprising++;
		}
		if(num2not>=p) {
			ifnotsurprising++;
		}
		if(num3not>=p) {
			ifnotsurprising++;
		}
		if(ifnotsurprising>0) return 1;
		else return 0;
		
	}
	public static int calcifSur(int k,int p) {
		int num1s=0;
		int num2s=0;
		int num3s=0;
		int kk=k%3;
		int ifsurprising=0;
		switch(kk) {
		case 0:
			if(k==30 || k==0) {
				num1s=k/3;
				num2s=k/3;
				num3s=k/3;
			} else {
				num1s=k/3-1;
				num2s=k/3;
				num3s=k/3+1;
				
			}
			
			break;
		case 1:
			if(k==1) {
				num1s=k/3;
				num2s=k/3;
				num3s=k/3+1;
				
			} else {
				num1s=k/3-1;
				num2s=k/3+1;
				num3s=k/3+1;
				
			}
		
			break;
		case 2:
			num1s=k/3;
			num2s=k/3;
			num3s=k/3+2;
			
			break;
		}
		if(num1s>=p) {
			ifsurprising++;
		}
		if(num2s>=p) {
			ifsurprising++;
		}
		if(num3s>=p) {
			ifsurprising++;
		}
		if(ifsurprising>0) return 1;
		else return 0;
	}
	public static int getAnswer(int[] x,int p,int surprisingleft,int start) {
		if(x.length-start<surprisingleft) {
			return Integer.MIN_VALUE;
		}
		if(start>=x.length && surprisingleft!=0) {
			return Integer.MIN_VALUE;
		}
		if(start==x.length && surprisingleft==0) {
			return 0;
		}
		boolean flag=false;
		if(surprisingleft==0) {
			flag=true;
		}
		int ifsurprising=0;
		int ifnotsurprising=0;
		int k=x[start]%3;
		int num1s=0;
		int num2s=0;
		int num3s=0;
		int num1not=0;
		int num2not=0;
		int num3not=0;
		switch(k) {
		case 0:
			if(x[start]==30 || x[start]==0) {
				num1not=x[start]/3;
				num2not=x[start]/3;
				num3not=x[start]/3;
				num1s=x[start]/3;
				num2s=x[start]/3;
				num3s=x[start]/3;
			} else {
				num1s=x[start]/3-1;
				num2s=x[start]/3;
				num3s=x[start]/3+1;
				num1not=x[start]/3;
				num2not=x[start]/3;
				num3not=x[start]/3;	
			}
			
			break;
		case 1:
			if(x[start]==1) {
				num1s=x[start]/3;
				num2s=x[start]/3;
				num3s=x[start]/3+1;
				num1not=x[start]/3;
				num2not=x[start]/3;
				num3not=x[start]/3+1;
			} else {
				num1s=x[start]/3-1;
				num2s=x[start]/3+1;
				num3s=x[start]/3+1;
				num1not=x[start]/3;
				num2not=x[start]/3;
				num3not=x[start]/3+1;
			}
		
			break;
		case 2:
			num1s=x[start]/3;
			num2s=x[start]/3;
			num3s=x[start]/3+2;
			num1not=x[start]/3;
			num2not=x[start]/3+1;
			num3not=x[start]/3+1;
			break;
		}
		if(num1s>=p) {
			ifsurprising++;
		}
		if(num2s>=p) {
			ifsurprising++;
		}
		if(num3s>=p) {
			ifsurprising++;
		}
		if(num1not>=p) {
			ifnotsurprising++;
		}
		if(num2not>=p) {
			ifnotsurprising++;
		}
		if(num3not>=p) {
			ifnotsurprising++;
		}
		if(flag) {
			if(ifnotsurprising>0)
			return getAnswer(x,p,surprisingleft,start+1)+1;
			else 
				return getAnswer(x,p,surprisingleft,start+1);
		}
		else {
			int acc21=0;
			int acc22=0;
			if(ifsurprising>0) {
				acc21=1;
			}
			if(ifnotsurprising>0) {
				acc22=1;
			}
		    
		if(getAnswer(x,p,surprisingleft-1,start+1)+acc21> getAnswer(x, p, surprisingleft, start+1)+acc22)
			return getAnswer(x,p,surprisingleft-1,start+1)+acc21;
		else 
			return getAnswer(x, p, surprisingleft, start+1)+acc22;
	   }
		
	}
}

