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.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class Dance {
	
	public static void main(String[] args) {
		BufferedReader reader = null;
		BufferedWriter writer = null;
		try {
            
			if (args.length == 0) {             
				System.out.println("Usage Dance <input_file>");
				System.exit(0);
			}
			
			File inputFile = new File(args[0]);

            if (!inputFile.exists())
            	System.out.println(String.format("File {0} not found in the current directory", args[0]));
            
     
            
			FileReader fileReader = new FileReader(inputFile.getAbsolutePath());
			reader = new BufferedReader(fileReader);
			FileWriter fileWriter = new FileWriter("Output.txt");
			writer = new BufferedWriter(fileWriter);
			String line = reader.readLine();			
			int numberOfTestCases = Integer.parseInt(line);
			for (int i = 0; i < numberOfTestCases; i++) {
				line = reader.readLine();
				String[] tokens = line.split(" ");
				int N = Integer.parseInt(tokens[0]);
				int S = Integer.parseInt(tokens[1]);
				int P = Integer.parseInt(tokens[2]);
				int[] totalScores = new int[N]; 
				for (int j = 3; j < tokens.length; j++) {
					totalScores[j - 3] = Integer.parseInt(tokens[j]);
				}
				writer.write("Case #" + (i + 1) + ": " + maxWithScoreGreaterThanP(P,S,totalScores));
				writer.newLine();
			}
						
		} catch (IOException e) {
			e.printStackTrace();
		} finally {
			try {
			if (reader!=null) {
				reader.close();
			}
			if (writer!=null) {
				writer.close();
			}
			} catch(Exception e) {}
		}		
	}

	private static int maxWithScoreGreaterThanP(int p, int s, int[] totalScores) {
		int count = 0;
		int remainingSurprises = s;
		for (int i = 0; i < totalScores.length; i++) {
			boolean found = false;
			int required = totalScores[i];
			for (int x=p; x<=10 && !found;x++) {
				for (int y = x; y >= x - 2 && y>= 0 && !found;y--) {
					for (int z = x; z >= y && z >=0 ;z--) {				
						if (x + y + z == required ) {
							int min = Math.min(y, z);
							if (min == x - 2 && remainingSurprises > 0){
								found = true;
								count++;
								remainingSurprises--;
								break;
							} else if (min > x-2) {
								found = true;
								count++;
								break;
							}						
						}
					}
				}
			}
		}
		return count;
	}
	
	


}
