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

public class DancingWithTheGooglers
{
    public DancingWithTheGooglers()
    {
        Scanner inFile = null;
        try
        {
            inFile = new Scanner(new File("inputB.txt"));
        }
        catch(Exception e)
        {
            System.out.println("Problem opening input file. Exiting...");
			System.exit(0);
        }
        int t = inFile.nextInt();
        
        int [] results = new int [t];
        DancingWithTheGooglersMax [] rnc = new DancingWithTheGooglersMax[t];
        
        int i, j;
        int [] scores;
        int s, p;
        for(i = 0; i < t; i++)
        {
            scores = new int [inFile.nextInt()];
            s = inFile.nextInt();
            p = inFile.nextInt();
            for(j = 0; j < scores.length; j++)
                scores[j] = inFile.nextInt();
            
            rnc[i] = new DancingWithTheGooglersMax(i, scores, s, p, results);
            rnc[i].start();
        }
        inFile.close();
        
        boolean done = false;
        
        while(!done)
        {
            done = true;
            for(i = 0; i < t; i++)
                if(rnc[i].isAlive())
                {
                    done = false;
                    break;
                }
        }
        
        PrintWriter outFile = null;
        try
        {
            outFile = new PrintWriter(new File("outputB.txt"));
        }
        catch(Exception e)
        {
            System.out.println("Problem opening output file. Exiting...");
			System.exit(0);
        }
        
        for(i = 0; i < results.length; i++)
            outFile.printf("Case #%d: %d\n", i+1, results[i]);
        outFile.close();
    }
    
    public static void main(String [] args)
    {
        new DancingWithTheGooglers();
    }
    
    private class DancingWithTheGooglersMax extends Thread
    {
        int id;
        int s, p;
        int [] results, scores;
        
        public DancingWithTheGooglersMax(int i, int [] aScores, int aS, int aP,int [] res)
        {
            id = i;
            s = aS;
            p = aP;
            results = res;
            scores = aScores;
        }
        
        public void run()
        {
            int a = 0, b = 0;
            
            if(p == 0)
                results[id] = scores.length;
            else if(p == 1)
            {
                int y;
                y = 3*p - 3;
                
                for(int i = 0; i < scores.length; i++)
                    if(scores[i] > y)
                        a++;
                    else if(scores[i] > 0)
                        b++;
                
                b = Math.min(b, s);
                results[id] = a+b;
            }
            else
            {
                int y, z;
                y = 3*p - 3;
                z = 3*p - 5;
                
                for(int i = 0; i < scores.length; i++)
                    if(scores[i] > y)
                        a++;
                    else if(scores[i] > z)
                        b++;
                
                b = Math.min(b, s);
                results[id] = a+b;
            }
        }
    }
}

import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.*;

import static java.lang.Math.*;
import static java.util.Arrays.*;

public class B {

	int INF = 1 << 28;

	void run() {
		Scanner sc;
		FileOutputStream fw;
		try {
			sc = new Scanner(new File("B.in"));
			fw = new FileOutputStream(new File("B.out"));
			PrintWriter pw = new PrintWriter(fw);
//			sc.useDelimiter("\\n");
			int n = sc.nextInt();
			for(int i=1;i<=n;i++) {
				int t = sc.nextInt();
				int s = sc.nextInt();
				int p = sc.nextInt();
				int[] total = new int[t];
				for(int j=0;j<t;j++) {
					total[j] = sc.nextInt();
				}
				sort(total);
				int[][] score = new int[t][3];
				for(int j=0;j<t;j++) {
					int ave = total[j]/3;
					if(total[j]%3 == 0) {
						score[j][0] = score[j][1] = score[j][2] = ave;
					}
					else if(total[j]%3 == 1) {
						score[j][0] = score[j][1] = ave;
						score[j][2] = ave+1;
					}
					else {
						score[j][0] = ave;
						score[j][1] = score[j][2] = ave+1;
					}
				}
				int cnt = 0;
				for(int j=0;j<t;j++) {
//					debug(score[j]);
					if( score[j][2] >= p ) cnt++;
					else if( s > 0 ){
						if( score[j][2] == score[j][1] && score[j][2] + 1 >= p &&
							total[j] != 0 && score[j][2] != 10) {
							s--;
							cnt++;
						}
					}
				}
				pw.println("Case #" + i + ": " + cnt);
			}
			pw.close();
			fw.close();
		} catch (FileNotFoundException e) {
			// TODO èªåçæããã catch ãã­ãã¯
			e.printStackTrace();
		} catch (IOException e) {
			// TODO èªåçæããã catch ãã­ãã¯
			e.printStackTrace();
		}
	}

	public static void main(String[] args) {
		new B().run();
	}

	void debug(Object... os) {
		System.err.println(Arrays.deepToString(os));
	}
}
