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;


public class qb {

	public static void main(String [] args)
	{
		String fileName = "B-small-attempt4.in";
		
		try{
			FileReader fr = new FileReader(fileName);
			BufferedReader br = new BufferedReader(fr);
			
			FileWriter fw = new FileWriter("output.txt");
			BufferedWriter bw = new BufferedWriter(fw);
			
			String line="";
			int count = 0;
			while((line=br.readLine())!=null)
			{
				if(count == 0)
				{
					count++;					
					continue;
				}
				String [] sp = line.split(" ");
				
				int [] rule = new int[3];	//rule 3°³¸¦ Áý¾î³ÖÀ½. 1.»ç¶÷¼ö, 2.¼­ÇÁ¶óÀÌÂ¡ °¹¼ö. 3.¸Æ½ºÁ¡¼ö				
				for(int i=0; i<3; i++)
					rule[i] = Integer.parseInt(sp[i]);

				
				int [] player = new int[sp.length-3];	//³ª¸ÓÁö µÚ¿¡ °ªµéÀÌ ÇÃ·¹ÀÌ¾î Á¡¼öÀÌ¹Ç·Î ´Æ.
				int [] playerScore = new int[player.length*3];	//ÇÑ»ç¶÷´ç ¼¼¸íÀÇ ½É»çÀ§¿ø Æò°¡ Á¡¼ö
				for(int i=0; i<player.length; i++)
					player[i] = Integer.parseInt(sp[i+3]);					
				
				for(int i=0; i<player.length; i++)		//½ºÄÚ¾î ºÐ¹è
				{
					if(player[i] % 3 == 0)
					{
						for(int j=0; j<3; j++)
						{
							playerScore[i*3] = player[i]/3;
							playerScore[i*3+1] = player[i]/3;
							playerScore[i*3+2] = player[i]/3;
						}
					}
					else if(player[i] % 3 == 1)
					{
						for(int j=0; j<3; j++)
						{
							playerScore[i*3] = player[i]/3+1;
							playerScore[i*3+1] = player[i]/3;
							playerScore[i*3+2] = player[i]/3;
						}						
						
					}
					else if(player[i] % 3 == 2)
					{
						for(int j=0; j<3; j++)
						{
							playerScore[i*3] = player[i]/3+1;
							playerScore[i*3+1] = player[i]/3+1;
							playerScore[i*3+2] = player[i]/3;
						}						
					}					
				}
				
				int nPlayerOverMax = 0;	
				int nPlayerCanSup = 0;
				int solution = 0;
				for(int i=0; i<player.length; i++) //°ËÃâ½Ä
				{
					if(rule[2]*3-3 < player[i])
						nPlayerOverMax++;
					else 
					{
						if(rule[2] < player[i] )
						{
							if(player[i] % 3 == 0 || player[i] %3 == 2)
							{
								
								if((playerScore[i*3]) +1 >= rule[2])
								{
									nPlayerCanSup++;
								}
							}
							else
							{
								if((playerScore[i*3]) >= rule[2])
									nPlayerCanSup++;
							}
								
						}
					}
				}
				if(nPlayerCanSup >= rule[1])
					solution = nPlayerOverMax + rule[1];
				else
					solution = nPlayerOverMax + nPlayerCanSup;
				
				if(solution > rule[0])
					solution = rule[0];
				
				bw.write("Case #"+count+": "+solution);
				bw.write("\n");
				count++;
			}
			
			bw.close();
			fw.close();
			br.close();
			fr.close();
			
				
		}catch(Exception EE)
		{
			EE.printStackTrace();
		}
		
		
	}
	
}
