import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;


public class DancingWithTheGooglers {
	public static void main(String[] args) throws IOException {
		BufferedReader f = new BufferedReader (new FileReader("B-small.in"));
		PrintWriter out = new PrintWriter(new FileWriter("B-small.out"));
		
		int t = Integer.parseInt(f.readLine());
		for (int i = 0; i < t; i++){
			int c = 0;
			StringTokenizer st = new StringTokenizer(f.readLine());
			int n = Integer.parseInt(st.nextToken());
			int[] ti = new int[n];
			int s = Integer.parseInt(st.nextToken());
			int p = Integer.parseInt(st.nextToken());
			for (int j = 0; j < n; j ++){
				ti[j] = Integer.parseInt(st.nextToken());
				if (ti[j] % 3 == 0){
					if (ti[j] / 3 >= p)
						c++;
					else if (ti[j] / 3 == (p-1) && s > 0 && ti[j] >= 2){
						s--;
						c++;
					}
				}
				else if (ti[j] % 3 == 1){
					if ((ti[j] / 3) + 1 >= p)
						c++;					
				}
				else{
					if (ti[j] / 3 >= p-1)
						c++;
					else if (ti[j] / 3 == (p-2) && s > 0){
						s--;
						c++;
					}
				}
					
				
			}
			out.println("Case #" + (i+1) + ": " + c);
			
			
		}
		out.close();
		System.exit(0);
		
		
		
	}
}

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

public class GoogleQual2012B
{   public static void main(String[] args) throws Throwable
    {   new GoogleQual2012B();
    }
    
    public GoogleQual2012B() throws Throwable
    {   Scanner in = new Scanner(new File("B-small-attempt2.in"));
        PrintWriter out = new PrintWriter(new FileWriter("B-small-attempt2.out"));
        int numTests = in.nextInt();
        for (int i = 0; i < numTests; i++)
        {   int numGoogs = in.nextInt();
            int numSuprsLeft = in.nextInt();
            int threshhold = in.nextInt();
            int total = 0;
            for (int j = 0; j < numGoogs; j++)
            {   int currTriple = in.nextInt();
                if (maxScore(currTriple) >= threshhold)
                {   total++;
                }
                else if (numSuprsLeft > 0 && maxScoreWithSurp(currTriple) >= threshhold)
                {   total++;
                    numSuprsLeft--;
                }
            }
            out.println("Case #" + (i + 1) + ": " + total);
        }
        out.close();
    }
    
    int maxScore(int total)
    {   if (total % 3 == 0)
        {   return total / 3;
        }
        return (total / 3) + 1;
    }
    
    int maxScoreWithSurp(int total)
    {   if (total == 0)
        {   return 0;
        }
        if (total % 3 == 2)
        {   return (total / 3) + 2;
        }
        return (total / 3) + 1;
    }
}