import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class Dancing {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		// read input file
		File file = new File("B-small-attempt4.in");
		//File file = new File("input.txt");
		BufferedReader br = new BufferedReader(new FileReader(file));
		String ln = "";
		int count = Integer.parseInt(br.readLine());

		// write output file
		File out = new File("outB.txt");
		BufferedWriter bw = new BufferedWriter(new FileWriter(out));
		
		int y = 0;
		for (int i=0; i < count; i++){
			ln = br.readLine();
			y = getY(ln);
			bw.write("Case #" + (i+1) + ": " + y);
			bw.newLine();
		}
		bw.close();
	}
	
	private static int getY(String str) {
		String[] data = str.split(" ");
		int n = Integer.parseInt(data[0]);
		int s = Integer.parseInt(data[1]);
		int p = Integer.parseInt(data[2]);
		int[] t = new int[n];
		for (int i=0; i < n; i++){
			t[i] = Integer.parseInt(data[i+3]);
		}
		int y = 0;
		int base = 0;
		for(int j=0; j < t.length; j++){
			base = t[j] / 3;
			if(base >= p) { y++; }
			else if(base == p-1){
				if(t[j] - (base+p) > base-1 && t[j] > 0){
					y++;
				} else if(s>0 && t[j] - (base+p) > base-2 && t[j] > 0){
					s -= 1;
					y++;
				}
			} else if(base == p-2){
				if(s > 0 && t[j] - (base+p) > base-1 && t[j] > 0){
					s -= 1;
					y++;
				}
			}
		}
		
		return y;
	}

}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
import java.io.*;
import java.util.*;
/**
 *
 * @author Alex
 */
public class GooglePartay
{
    
    public static void main(String sArgs[]) throws IOException
    {
        
        Scanner oScan = new Scanner(new File("B-small-attempt2.in"));
        //Scanner oScan = new Scanner(new File("sompin.txt"));
        int sets = Integer.parseInt(oScan.nextLine().trim());
        int count = 0;
        while(sets-->0)
        {
            count++;
            int googlers = oScan.nextInt();
            int sp = oScan.nextInt();
            int lim = oScan.nextInt();
            int[] scores = new int[googlers];
            for (int i = 0; i <googlers; i++)
            {
                scores[i]=oScan.nextInt();
            }
            int above = 0;
            ArrayList<Googler> list = new ArrayList<Googler>();
            for (int i = 0; i <scores.length; i++)
            {
                list.add(new Googler(scores[i],lim));
            }
            for(Googler g:list)
            {
                //System.out.println(g);
                if(g.above&&!g.surpr)above++;//System.out.println(g);
                else if(g.above&&g.surpr&&sp>0)
                {
                    sp--;
                    above++;
                }
            }
            System.out.println("Case #"+count+": "+above);
        }
    }
}
class Googler
{
    ArrayList<Score> list = new ArrayList<Score>();
    int n, p;boolean above, surpr;
    class Score implements Comparable<Score>
    {
        int A, B, C, best;boolean surp;
        public Score(){}
        public Score(int a, int b, int c)
        {
            A=a;
            B=b;
            C=c;
           // tot=a+b+c;
            if(Math.max(Math.max(Math.abs(a-b),Math.abs(a-c)),Math.abs(b-c))>1)surp = true;
            best = (int)Math.max(Math.max(a,b),c);
        }
        
        public int compareTo(Score o)
        {
            return surp^o.surp?best-o.best:surp?1:-1;
        }
        
        public String toString()
        {
            return "("+A+","+B+","+C+")"+(surp?"*":"");
        }
    }
    public Googler(){}
    public Googler(int n, int p)
    {
        this.n=n;
        this.p=p;
        createScores();
        Collections.sort(list);
        for(Score s:list)
        {
            if(!s.surp)
            {
                if(s.best>=p)above = true;
            }
        }
        if(above!=true)
        {
            for(Score s: list)
            {
                if(!above)
                {
                    if(s.best>=p)
                    {
                        above = true;
                        surpr = true;
                    }
                }
            }
        }
    }
    public boolean valid(int a, int b, int c)
    {
        return Math.max(Math.max(Math.abs(a-b),Math.abs(a-c)),Math.abs(b-c))<=2;
    }
    public void createScores()
    {
        for(int i = 0; i<=n; i++)
        {
            for(int j = i; j<=n;j++)
            {
                for(int k = j; k<=n; k++)
                {
                    if(valid(i,j,k)&&i+j+k==n)list.add(new Score(i,j,k));
                }
            }
        }
    }
    public String toString()
    {
        return n+"  "+list.toString()+above+surpr;
    }
}