package googlers;

import java.util.Scanner;
import java.util.PriorityQueue;
import java.util.Comparator;
public class Googlers {
	
	public static void main(String[] args) {
		
		int n,s,p,count=0,t;		
		Scanner sin=new Scanner(System.in);
		
		t=Integer.parseInt(sin.nextLine());
		
		
		int result[]=new int[t];
		int j=0;
		
		if(t>=1 && t<=100)
		{
		for (int k = 0; k < t; k++) {
		count=0;	
		
			
        String ip = sin.nextLine();
        
        String[]tokens=ip.split(" ");
		
		
		n=Integer.parseInt(tokens[0]);
		s=Integer.parseInt(tokens[1]);
		p=Integer.parseInt(tokens[2]);
		
		if( (s>=0 && s<=n) && (p>=0 && p<=10) )
		{
		int[] total=new int[n];
		
		
		for (int i = 0; i < n; i++)
        {
            total[i] = Integer.parseInt(tokens[i+3]);
        }
		
		Comparator comparator=new PointComparator();
		PriorityQueue pq=new PriorityQueue<Point>(1, comparator);
		
		for (int i = 0; i < n; i++)
		{
			
			int x=total[i]/3;
			int r=total[i]%3;
			if(x>=p)
				count++;
			else if(x<(p-2))
				continue;
			else
			{
				//System.out.println("enter "+x+" "+(p-2));
				if(p-x==1)
				{
					Point temp=new Point();
					temp.q=x;
					temp.r=r;
					pq.add(temp);
				}
				else  // p-x=2
				{
					if(r==0)
						continue;
					else
					{
						Point temp=new Point();
						temp.q=x;
						temp.r=r;
						pq.add(temp);
					}				
					
				}
					
			}
			//System.out.println("hi "+pq.size());
			
		}
		
		
		
		while(pq.size()!=0)
		{
			Point temp=(Point)pq.remove();
			if(p-temp.q==1 && temp.q!=0)
			{
				if(temp.r>=1)
					count++;
				else
				{
					if(s!=0)
					{
						s--;
						count++;
					}
				}
			}
			else if(p-temp.q==2)
			{
				if(s!=0 && (temp.q+temp.r)>=p)
				{
					s--;
					count++;
				}
			}
			
				
		}
		
		//System.out.println(p);
		
		result[j++]=count;
		
		}
		}
		
		for (int i = 0; i < t; i++) 
		{
			System.out.println("Case #"+(i+1)+": "+result[i]);
		}
		}
		
	}
        
        
		
		/*Point x=new Point();
		x.q=8;
		Point y=new Point();
		y.q=6;
		Point z=new Point();
		z.q=7;
		
		pq.add(x);
		pq.add(y);
		pq.add(z);
		*/
		
		
		
		
	

}

class PointComparator implements Comparator<Point>
{
    @Override
    public int compare(Point x, Point y)
    {
        // Assume neither string is null. Real code should
        // probably be more robust
        if (x.q < y.q)
        {
            return 1;
        }
        if (x.q  > y.q)
        {
            return -1;
        }
        return 0;
    }
}



class Point
{
	int q,r;

	public int getQ() {
		return q;
	}

	public void setQ(int q) {
		this.q = q;
	}

	public int getR() {
		return r;
	}

	public void setR(int r) {
		this.r = r;
	}
	
	
}

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.StringTokenizer;


public class Dancing { 
	
	
 	public static void main(String[] arg) throws Exception {
 		Dancing pg = new Dancing();
	 
		 pg.go();
	}
 	
 	Dancing()
	{
 	 
 
	}
 	

 	private int addThisScore(int totalPoints, int p)
 	{
 		int avg = totalPoints / 3;
 		int low = Math.max(0,  avg - 2);
 		int high = Math.min(10, avg + 2);
 		int bestResult;
 		
 		int S, NS;
 		S = 0;
 		NS = 0;
 	
 		for(int i = low; i <=high; i++)
 		{
 			for(int j = low; j <=high; j++)
 	 		{
 				for(int k = low; k <=high; k++)
 		 		{
 		 			if((i + j + k) != totalPoints)
 		 				continue;
 		 			
 		 			if(Math.abs(i-j) > 2 || Math.abs(j-k) > 2 || Math.abs(i-k) > 2)
 		 				continue;
 		 			
 		 			bestResult = Math.max(Math.max(i, j),k);
 		 			if(bestResult < p)
 		 				continue;
 		 				
 		 			//System.out.println("Triplet = " +i +" "+j +" "+k);
 		 			
 		 			if(bestResult >= p)
 		 			{
 		 				//is this a surprising triplet
 		 				if(Math.abs(i-j) == 2 || Math.abs(j-k) == 2 || Math.abs(i-k) == 2)
 		 				{
 		 					S = 2;
 		 				}
 		 				else
 		 				   NS = 1;
 		 			}
 		 			
 		 		}
 	 			
 	 		}
 			
 		}
 		return S + NS;
 	}
 	public void go()
	{
 		String line = "";
			try {
			    BufferedReader in = new BufferedReader(new FileReader("B-small-attempt0.in"));
			     
			    StringBuilder outString = new StringBuilder();
			    StringTokenizer tokens;
			    
	             
	            int caseNo = 0;
	             
	            int T = Integer.parseInt(in.readLine().trim());
	            int N, S, p, t;
	            int totalGooglers;
	            int totalSurprisingTriplets;
	            while(caseNo++ < T)
	            {
 	              line = in.readLine().trim();
 	              totalGooglers = 0;
 	              totalSurprisingTriplets = 0;
 	              tokens = new StringTokenizer(line);
 	              N = Integer.parseInt(tokens.nextToken().trim());
 	              S = Integer.parseInt(tokens.nextToken().trim()); //noof surprises
 	              p = Integer.parseInt(tokens.nextToken().trim());
 	              int res;
 	              while(N > 0)
 	              {
 	            	  t = Integer.parseInt(tokens.nextToken().trim());
 	            	// System.out.println("**** " + t +" ****");
 	            	  res = addThisScore(t, p);
 	            	 
 	            	  if(res != 0)
 	            	  {
 	            		  if(res == 2)
 	            		  {
 	            			  totalSurprisingTriplets++;
 	            		  }
 	            		  else
 	            		    totalGooglers++;
 	            	  }
 	            	  N--;
 	              }
 	              if(S < totalSurprisingTriplets)
 	              {
 	            	 totalSurprisingTriplets = S; 	            	  
 	              }
 	              
 	             totalGooglers +=  totalSurprisingTriplets;
            	  
 	             outString.append("Case #" + caseNo + ": " + totalGooglers); 	               
	             
	              outString.append("\n");
	            }
	  		    BufferedWriter pwr = new BufferedWriter(new FileWriter("output.txt"));
			    pwr.write(outString.toString());
			    pwr.close();		    
			    in.close();
			}
			catch (Exception e) 
			{
				e.printStackTrace();
				System.out.println("processing : " + line);
			}
	}
}
