package dancinggooglers;

import java.io.File;
import java.util.Scanner;

public class DanceScoreCalculator {


    public static void main(String[] args) {
        if(args.length <= 0 || args[0] == null) {
            System.out.println("You must enter a file to read");
            System.out.println("Usage: blah <filename>");
            System.exit(0);
        }

        File argFile = new File(args[0]);
        try {
            Scanner googleSpeakScanner = new Scanner(argFile);
            String firstLine = googleSpeakScanner.nextLine();
            Integer linesToScan = new Integer(firstLine);
            for(int i = 1; i <= linesToScan; i++) {
                String googleDancerLine = googleSpeakScanner.nextLine();
                DanceScoreCase danceCase = new DanceScoreCase(googleDancerLine);
                System.out.println(String.format("Case #%d: %d", i, danceCase.maxDancersThatCouldPass()));
            }
        }
        catch (Exception e) {
            e.printStackTrace();
        }
    }
}

import java.util.*;

public class B {

public static void main(String[] args)

	{
			Scanner in = new Scanner(System.in);
			
			int T = Integer.parseInt(in.nextLine());
			
			for (int test = 0 ; test < T ; test ++)
			{

				String input = in.nextLine();
				String[] bIn = input.split(" ");
				
				int googlersNum = Integer.parseInt(bIn[0]);
				int suprisingMax = Integer.parseInt(bIn[1]);
				int requirement = Integer.parseInt(bIn[2]);
				
				int okay=0;
				int suprising=0;
				
				for (int run = 0 ; run < googlersNum ; run ++)
				{
			
					int S = Integer.parseInt(bIn[3+run]);

					int temp = S;
					boolean testCase = false,done=false;
			
		
					for (int i = 10 ; i >= 0 ; i--)
					{
						for (int j =  i ; j >= i-1 && j >= 0; j--)
						{
							for (int k = i ; k >= i-1  && k >= 0; k --)
							{
									temp = temp - k  - i - j;

									if (temp == 0) 
									{ 
									
										if ((i >= requirement || j >= requirement || k >= requirement) && !done)
										{
											okay++;
											done = true;
										}
									
									}
									temp = S;
							}
						}
					}	
				
					temp = S;
				
					if (!testCase && suprising < suprisingMax)
					{
						for (int i = 10 ; i >= 0 ; i--)
						{
							for (int j = i ; j >= i-2 && j >= 0 ; j--)
							{
								for (int k = i ; k >= i-2  && k >= 0 ; k--)
								{
									temp = temp - i - k - j;
									if (temp == 0) 
									{ 
										if ((i >= requirement || j >= requirement || k >= requirement) && !done)
										{
											testCase = true;
											suprising++;
											okay++;
											done = true;
										}
									
									}
									temp = S;

								}
							}
						}
					}
				}
				
				System.out.println("Case #"+(test+1)+": "+okay);
			}
					
			in.close();
	}
	
}
			
			