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;
	}
	
	
}

package code.jam;

import java.io.*;
import java.util.*;

public class CodeJam {
    
    public static void main(String[] args) throws FileNotFoundException, IOException {
        
        String name = "B-small-attempt2";
        
        Scanner in = new Scanner( new BufferedReader( new FileReader(name + ".in") ) );
        BufferedWriter out = new BufferedWriter( new FileWriter(name + ".out") );
        
        int N = in.nextInt();
        
        int num , n_surprise , best_result;
        int surr_count , req_count;
        boolean sol_found , looper;
        int x , y , diff , temp;
        int i,j,k = 1;
        int[] results = null;
        int[] arr = new int[3];
        
        while( in.hasNext() )
        {
            num = in.nextInt();
            n_surprise = in.nextInt();
            best_result = in.nextInt();
            results = new int[num];
            
            for(i=0 ; i<num ; i++)
                results[i] = in.nextInt();
                
            req_count = 0;
            surr_count = 0;
            
            for(i=0 ; i<num ; i++)
            {
                diff = 0;
                sol_found = false;
                looper = true;
                
                if( (results[i]&1) == 0 )
                {
                    //even result
                    if( (best_result&1) == 0 )
                        y = best_result;
                    else
                        y = best_result-1;
                }
                else
                {
                    //odd result
                    if( (best_result&1) != 0 )
                        y = best_result;
                    else
                        y = best_result-1;
                }
                
                while(looper)
                {
                    x = (results[i]-y)/2;
                    diff = Math.abs(x-y);
                    
                    if( (diff == 0) || (diff == 1) )
                    {
                        if( (x >= best_result) || (y >= best_result) )
                        {
                            req_count++;
                            looper = false;
                            sol_found = true;
                        }
                        else
                            y++;
                    }
                    else
                        y++;
                    
                    if( (y >= 10) || (y >= results[i]) )
                        looper = false;
                }
                
                if(!sol_found)
                {
                    y = best_result;
                    temp = results[i]-y;
                    
                    if( (temp&1) == 0 )
                    {
                        x = temp/2;
                        temp /= 2;
                    }
                    else
                    {
                        x = (temp/2)+1;
                        temp = results[i]-x-y;
                    }
                    
                    arr[0] = y;
                    arr[1] = x;
                    arr[2] = temp;
                    
                    Arrays.sort(arr);
                    
                    diff = Math.abs(arr[0]-arr[2]);
                    
                    if (diff == 2)
                    {
                        if(surr_count < n_surprise)
                        {
                            surr_count++;
                            req_count++;
                        }
                    }
                }
            }
            
            out.write("Case #" + k + ": " + req_count);
            out.newLine();
            k++;
        }
        
        out.close();
    }
    
    //----------------------------------------------------------------------
    
    public static int digitsCount(int num)
    {
        int count = 0;
        
        while(num > 0)
        {
            count++;
            num = num/10;
        }
        
        return count;
    }
    
    //----------------------------------------------------------------------
    
    public static void filterArray(boolean[] arr)
    {
        int length = arr.length-1;
        
        int i;
        int temp = 0;
        
        
        if( (length > 10) && (length <= 100) )
        {
            temp = 11;
            for(i=2 ; i<=10 && temp <= length ; i++)
            {
                arr[temp] = true;
                temp = i*11;
            }
        }
        
        if( (length > 100) && (length <= 1000) )
        {
            temp = 111;
            for(i=2 ; i<=10 && temp <= length ; i++)
            {
                arr[temp] = true;
                temp = i*111;
            }
        }
        
        if( (length > 1000) && (length <= 10000) )
        {
            temp = 1111;
            for(i=2 ; i<=10 && temp <= length ; i++)
            {
                arr[temp] = true;
                temp = i*1111;
            }
        }
        
        if( (length > 10000) && (length <= 100000) )
        {
            temp = 11111;
            for(i=2 ; i<=10 && temp <= length; i++)
            {
                arr[temp] = true;
                temp = i*11111;
            }
        }
        
        if( (length > 100000) && (length <= 1000000) )
        {
            temp = 111111;
            for(i=2 ; i<=10 && temp <= length ; i++)
            {
                arr[temp] = true;
                temp = i*111111;
            }
        }
        
        if( (length > 1000000) && (length <= 2000000) )
            arr[1111111] = true;
    }
}
