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.*;



public class DancingGooglers {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		int T = 0;
		int N = 0;
		int S = 0;
		int p = 0;
		int ptr = 0;
		int maxCount = 0;
		int scoreSum = 0;
		int score1 = 0;
		int score2 = 0;
		int score3 = 0;
		String currentCase = null;
		String inputFilename = "B-small-attempt0.in";
		String outputFilename = "B-small-attempt0.out";
		
		BufferedWriter out = null;
		try {
			out = new BufferedWriter(new FileWriter(outputFilename));
		} catch (IOException e2) {
			// TODO Auto-generated catch block
			e2.printStackTrace();
		}
		
		FileInputStream fStream = null;
		try {
			fStream = new FileInputStream(inputFilename);
		} catch (FileNotFoundException e1) {
			// TODO Auto-generated catch block
			e1.printStackTrace();
		}
		DataInputStream in = new DataInputStream(fStream);
		BufferedReader br = new BufferedReader(new InputStreamReader(in));
		
		
		try {
			T = Integer.parseInt(br.readLine());
		} catch (NumberFormatException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
		
		
		for(int i=0;i<T;i++) {
			try {
				currentCase = br.readLine();
			} catch (IOException e) {
				// TODO Auto-generated catch block
				e.printStackTrace();
			}
			maxCount = 0;
			ptr = currentCase.indexOf(' ');
			
			N = Integer.parseInt(currentCase.substring(0,ptr));
			S = Integer.parseInt(currentCase.substring(ptr,currentCase.indexOf(' ',ptr+1)).trim());
			
			ptr = currentCase.indexOf(' ',ptr+1);
			
			p = Integer.parseInt(currentCase.substring(ptr,currentCase.indexOf(' ',ptr+1)).trim());

			
			for(int j=0;j<N;j++) {
				ptr = currentCase.indexOf(' ',ptr+1);
				if (j == N-1) {
					scoreSum = Integer.parseInt(currentCase.substring(ptr).trim());
				}
				else {
					scoreSum = Integer.parseInt(currentCase.substring(ptr,currentCase.indexOf(' ',ptr+1)).trim());
				}

				score1 = scoreSum / 3;
				score2 = (scoreSum - score1) / 2;
				score3 = scoreSum - score1 - score2;
				if (score1 >= p || score2 >= p || score3 >= p) {
					maxCount++;
					continue;
				}
				else {
					if ((S > 0) && (scoreSum > 0)) {
						if (scoreSum < (3*p-4)) {
							//Minimum total points required for to get at least 1 "best result"
							continue;
						}
						
						while ((Math.abs(score1 - score2) < 3) && (Math.abs(score1 - score3) < 3) && (Math.abs(score2 - score3) < 3)) {
							if (score1 >= score2 && score1 >= score3) {
								if (score2 >= score3) {
									if ((score1 + 1) - (score2 - 1) < 3) {
										score1++;
										score2--;
									}
								}
								else {
									if ((score1 + 1) - (score3 - 1) < 3) {
										score1++;
										score3--;
									}
								}
							}
							else if (score2 >= score1 && score2 >= score3) {
								if (score1 >= score3) {
									if ((score2 + 1) - (score1 - 1) < 3) {
										score2++;
										score1--;
									}
								}
								else {
									if ((score2 + 1) - (score3 - 1) < 3) {
										score2++;
										score3--;
									}
								}
							}
							else if (score3 >= score1 && score3 >= score2) {
								if (score1 >= score2) {
									if ((score3 + 1) - (score1 - 1) < 3) {
										score3++;
										score1--;
									}
								}
								else {
									if ((score3 + 1) - (score2 - 1) < 3) {
										score3++;
										score2--;
									}
								}
							}
							
							if (score1 >= p || score2 >= p || score3 >= p) {
								maxCount++;
								S--;
								break;
							}
						}
						
					}
				}
				
			}
			
			try {
				out.write("Case #"+(i+1)+": "+maxCount+'\n');
			} catch (IOException e) {
				// TODO Auto-generated catch block
				e.printStackTrace();
			}
		}
		try {
			out.close();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}	

	}

}
