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.File;
import java.io.FileReader;
import java.io.FileWriter;


public class ProblemB {
	public int[] deriveScores(int totalScore) {
		if (totalScore < 0 || totalScore > 30) {
			throw new IllegalArgumentException("invalid totalScore passed: " + totalScore);
		}
		
		int n = totalScore / 3;
		int r = totalScore % 3;
		int[] scores = new int[3];
		
		scores[0] = n;
		scores[1] = n + r / 2;
		scores[2] = n + r - (r / 2);
		
//		if (n == 0) {
//			if (surprise) {
//				scores[2] += r;
//			} else {
//				scores[1] += r / 2;
//				scores[2] += r - (r / 2);
//			}
//		} else if (n == 9) {
//			scores[1] += r / 2;
//			scores[2] += r - (r / 2);
//		} else if (0 < n && n < 9) {
//			if (surprise) {
//				if (r == 0) {
//					scores[0]--;
//					scores[2]++;
//				} else if (r == 1) {
//					scores[0]--;
//					scores[1]++;
//					scores[2] += 1;
//				} else if (r == 2) {
//					scores[2] += r;	
//				}
//			} else {
//				scores[1] += r / 2;
//				scores[2] += r - (r / 2);
//			}
//		}
		
		return scores;
	}
	
	public int[] makeSurprise(int[] scores) {
		int[] newScores = scores.clone();
		
		if (scores[0] >= 1 && scores[2] <= 9) {
			if (scores[2] == scores[0]) {
				newScores[0]--;
				newScores[2]++;				
			} else if (scores[2] == scores[1]) {
				newScores[1]--;
				newScores[2]++;
			}
		}
		
		return newScores;
	}
	
	public boolean checkIfSurprisingScore(int[] scores) {
		return scores[scores.length - 1] - scores[0] >= 2;
	}
	
	public void solve(String inputFileName, String outputFileName) {
		try {
			BufferedReader reader = new BufferedReader(new FileReader(new File(inputFileName)));
			BufferedWriter writer = new BufferedWriter(new FileWriter(outputFileName));
			
			int testCount = Integer.parseInt(reader.readLine());
			for (int i = 0; i < testCount; i++) {
				String testCase = reader.readLine();
				String[] fields = testCase.split(" ");
				int manCount = Integer.parseInt(fields[0]);
				int surpriseCount = Integer.parseInt(fields[1]);
				int bestScore = Integer.parseInt(fields[2]);
				int bestScoreCount = 0;
				
				for (int j = 0; j < manCount; j++) {
					int totalScore = Integer.parseInt(fields[j + 3]);
					int[] scores = this.deriveScores(totalScore);
					
					if (scores[2] < bestScore) {
						if (surpriseCount > 0) {
							int[] tempScores = this.makeSurprise(scores);
							if (tempScores[2] >= bestScore) {
								scores = tempScores;
								surpriseCount--;
							}	
						}
					}
					
					if (scores[2] >= bestScore) {
						bestScoreCount++;
//						System.out.println(totalScore + ", best");
					} else {
//						System.out.println(totalScore);
					}
				}
				
				writer.write("Case #" + (i + 1) + ": " + bestScoreCount);
				writer.newLine();
			}
			
			reader.close();
			writer.close();
		} catch (Exception e) {
			throw new RuntimeException(e.getMessage(), e);
		}
	}
	
	public static void main(String[] args) {
		ProblemB problem = new ProblemB();
//		problem.solve("B-small-attempt.in", "B-small-attempt.out");
		problem.solve("B-small-attempt0.in", "B-small-attempt0.out");
//		problem.solve("B-small-attempt.in", "B-small-attempt.out");
//		problem.solve("B-small-attempt.in", "B-small-attempt.out");
//		problem.solve("B-small-attempt.in", "B-small-attempt.out");
	}
}
