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.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Scanner;


public class DancingGooglers {

	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(new File("input.in"));
		BufferedWriter bfrw = new BufferedWriter(new FileWriter("output.out"));
		
		int N = in.nextInt();
		String output = "";
		for(int i = 0; i < N;i++){
			
			int n = in.nextInt();
			int s = in.nextInt();
			int p = in.nextInt();
			
			int [] num = new int[n];
			for(int j = 0; j < n;j++){
				num[j] = in.nextInt();
			}
			output += "Case #"+(i+1)+": " + solve(num,s,p) + "\n";
		}
		
		bfrw.write(output);
		in.close();
		bfrw.close();
	}
	
	private static int solve(int [] num, int S, int P){
		int ans = 0;
		
		for(int x = 0; x < num.length;x++) {
			int N = num[x];
			ArrayList<String> al = new ArrayList<String>();
			for(int i = 10; i >= 0; i--){
				for(int j = 10; j >= 0; j--){
					for(int k = 10; k >= 0; k--){
						if(i+j+k == N && Math.max(Math.max(i,j), k) >= P && isValid(i, j, k)){
							
							//System.out.println(i + " " + j +" " + k);
							al.add(i+","+j+","+k);
							//break here;
						}
					}
				}
			}
			
			if(al.size() > 0 && !isSurprizeTrue(al)){
				ans++;
			} else if (al.size() > 0 && isSurprizeTrue(al) && S > 0) {
				ans++;
				S--;
			}
			//System.out.println();
		}
		return ans;
	}
	
	private static boolean isSurprizeTrue(ArrayList<String> al){
		for(int i = 0; i < al.size();i++){
			String[] s = al.get(i).split(",");
			if(!isSurprize(Integer.parseInt(s[0]),Integer.parseInt(s[1]),Integer.parseInt(s[2]))) return false;
		}
		return true;
	}
	
	private static boolean isValid(int i,int j, int k){
		if(Math.abs(i-j) > 2) return false;
		if(Math.abs(i-k) > 2) return false;
		if(Math.abs(j-k) > 2) return false;
		return true;
	}
	
	private static boolean isSurprize(int i,int j, int k){
		if(Math.abs(i-j) == 2) return true;
		if(Math.abs(i-k) == 2) return true;
		if(Math.abs(j-k) == 2) return true;
		return false;
	}
}
