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.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;
import java.util.StringTokenizer;


public class ProblemBDancingWithTheGooglers {
	
	private static int lines;
	private static Scanner input;
	private static String [] outputs;
	
	public static void main(String[] args) {
		try {
			input = new Scanner(new FileReader(args[0]));
		} catch (FileNotFoundException e) {
			e.printStackTrace();
			System.exit(-1);
		}
		lines = Integer.parseInt(input.nextLine());
		outputs = new String [lines];
		for(int i = 1; i<=lines; i++)
		{
			int maxVal;
			int num;
			int supriseCase;
			int iAns = 0;
			String ans = "Case #" + i + ": ";
			StringTokenizer str = new StringTokenizer(input.nextLine());
			num = Integer.parseInt(str.nextToken());
			supriseCase = Integer.parseInt(str.nextToken());
			maxVal = Integer.parseInt(str.nextToken());
			for(int j = 0; j<num; j++)
			{
				Triplet t = new Triplet(Integer.parseInt(str.nextToken()));
				if(t.highest()>=maxVal)
				{
					iAns++;
				}
				else if(supriseCase>0 && (t.highest() + 1)>= maxVal && t.highest() != t.sum && t.canBeSuprise())
				{
					supriseCase--;
					iAns++;
				}
				
			}
			ans += iAns;
			outputs[i-1] = ans;
			
		}
		try{
			 
    	    File file =new File("outputB.txt");
 
    	    //if file doesnt exists, then create it
    	    if(!file.exists()){
    		file.createNewFile();
    	    }
 
    	    FileWriter fw = new FileWriter(file.getName());
    	    BufferedWriter bw = new BufferedWriter(fw);
    	    for(int k = 0; k<outputs.length; k++)
    	    {
    	    	bw.write(outputs[k]);
    	    	bw.newLine();
    	    }
    	    bw.close();
    	    
		}catch(IOException e){
    		e.printStackTrace();
    	}

	}
	public static class Triplet {
		public static int sum, x, y, z;
		public Triplet(int i)
		{
			sum = i;
			x = (int) Math.round(((double)sum)/3.0);
			y = (int) Math.round(((double)sum)/3.0);
			z = sum - x - y;
		}
		public static boolean canBeSuprise()
		{
			return ((x==y && x==z) || x>z);
		}
		public static boolean allEqual()
		{
			return (x==y && x==z);
		}
		public static int highest()
		{
			if(x>=y)
			{
				if (x>=z)
				{
					return x;
				}
				else
				{
					return z;
				}
			}
			else
			{
				if(y>=z)
				{
					return y;
				}
				else
				{
					return z;
				}
			}
		}
	}

}
