package CodeJam.c2012.clasificacion;

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;

/**
 * Problem
 *
 * You're watching a show where Googlers (employees of Google) dance, and then
 * each dancer is given a triplet of scores by three judges. Each triplet of
 * scores consists of three integer scores from 0 to 10 inclusive. The judges
 * have very similar standards, so it's surprising if a triplet of scores
 * contains two scores that are 2 apart. No triplet of scores contains scores
 * that are more than 2 apart.
 *
 * For example: (8, 8, 8) and (7, 8, 7) are not surprising. (6, 7, 8) and (6, 8,
 * 8) are surprising. (7, 6, 9) will never happen.
 *
 * The total points for a Googler is the sum of the three scores in that
 * Googler's triplet of scores. The best result for a Googler is the maximum of
 * the three scores in that Googler's triplet of scores. Given the total points
 * for each Googler, as well as the number of surprising triplets of scores,
 * what is the maximum number of Googlers that could have had a best result of
 * at least p?
 *
 * For example, suppose there were 6 Googlers, and they had the following total
 * points: 29, 20, 8, 18, 18, 21. You remember that there were 2 surprising
 * triplets of scores, and you want to know how many Googlers could have gotten
 * a best result of 8 or better.
 *
 * With those total points, and knowing that two of the triplets were
 * surprising, the triplets of scores could have been:
 *
 * 10 9 10 6 6 8 (*) 2 3 3 6 6 6 6 6 6 6 7 8 (*)
 *
 * The cases marked with a (*) are the surprising cases. This gives us 3
 * Googlers who got at least one score of 8 or better. There's no series of
 * triplets of scores that would give us a higher number than 3, so the answer
 * is 3.
 *
 * Input
 *
 * The first line of the input gives the number of test cases, T. T test cases
 * follow. Each test case consists of a single line containing integers
 * separated by single spaces. The first integer will be N, the number of
 * Googlers, and the second integer will be S, the number of surprising triplets
 * of scores. The third integer will be p, as described above. Next will be N
 * integers ti: the total points of the Googlers.
 *
 * Output
 *
 * For each test case, output one line containing "Case #x: y", where x is the
 * case number (starting from 1) and y is the maximum number of Googlers who
 * could have had a best result of greater than or equal to p.
 *
 * Limits
 *
 * 1 â¤ T â¤ 100. 0 â¤ S â¤ N. 0 â¤ p â¤ 10. 0 â¤ ti â¤ 30. At least S of the ti values
 * will be between 2 and 28, inclusive.
 *
 * Small dataset
 *
 * 1 â¤ N â¤ 3.
 *
 * Large dataset
 *
 * 1 â¤ N â¤ 100.
 *
 * Sample
 *
 * Input Output 4 Case #1: 3 3 1 5 15 13 11 Case #2: 2 3 0 8 23 22 21 Case #3: 1
 * 2 1 1 8 0 Case #4: 3 6 2 8 29 20 8 18 18 21
 *
 * @author Leandro Baena Torres
 */
public class B {

    public static void main(String[] args) throws FileNotFoundException, IOException {
        BufferedReader br = new BufferedReader(new FileReader("B.in"));
        String linea;
        int numCasos, N, S, p, t[], y, minSurprise, minNoSurprise;

        linea = br.readLine();
        numCasos = Integer.parseInt(linea);
        for (int i = 0; i < numCasos; i++) {
            linea = br.readLine();
            String[] aux = linea.split(" ");
            N = Integer.parseInt(aux[0]);
            S = Integer.parseInt(aux[1]);
            p = Integer.parseInt(aux[2]);
            t = new int[N];
            y = 0;
            minSurprise = p + ((p - 2) >= 0 ? (p - 2) : 0) + ((p - 2) >= 0 ? (p - 2) : 0);
            minNoSurprise = p + ((p - 1) >= 0 ? (p - 1) : 0) + ((p - 1) >= 0 ? (p - 1) : 0);
            for (int j = 0; j < N; j++) {
                t[j] = Integer.parseInt(aux[3 + j]);
                if (t[j] >= minNoSurprise) {
                    y++;
                } else {
                    if (t[j] >= minSurprise) {
                        if (S > 0) {
                            y++;
                            S--;
                        }
                    }
                }
            }

            System.out.println("Case #" + (i + 1) + ": " + y);
        }
    }
}

import java.util.Scanner;

/**
 * author - coolprosu
 * Problem - B
 */

public class DancingWithTheGooglers {
	private int T = 0;
	int N[], S[], p[], t[][];
	public static void main(String[] args) {
		DancingWithTheGooglers solveProb = new DancingWithTheGooglers();
		solveProb.solve();
	}
	private void solve() {
		Scanner sc = new Scanner(System.in);
		//Input no. of test cases
		T = sc.nextInt();
		//Solved strings
		String solutionArray[] = new String[T];		
		N = new int[T];
		S = new int[T];
		p = new int[T];
		t = new int[T][];
		for(int i=0;i<T;i++) {
			solutionArray[i] = "Case #"+(i+1)+": ";			
			N[i] = sc.nextInt();
			S[i] = sc.nextInt();
			p[i] = sc.nextInt();
			t[i] = new int[N[i]];
			for(int j=0;j<N[i];j++) {
				t[i][j] = sc.nextInt();
			}
			solutionArray[i] += solveCase(N[i],S[i],p[i],t[i]); 
		}
		//Output result
		for(int i=0;i<T;i++) {
			System.out.println(solutionArray[i]);
		}		
	}
	private int solveCase(int N, int S, int p, int t[])	{
		int maxPossibility = 0;
		/**
		 * Eliminitation
		 */
		//Reject impossible cases (where total points <= (p+p-2+p-2))
		int possibleN = 0;
		int possibleT[] = new int [N];
		int minPossibleTotal = p+p-2+p-2;
		minPossibleTotal = (p>minPossibleTotal)?p:minPossibleTotal; //minPossibleTotal should be at least p
		for(int i=0;i<N;i++)
		{
			if(t[i]>=minPossibleTotal)
			{
				possibleT[possibleN++] = t[i];
				//System.out.println("Possible:"+t[i]+" Possible N:"+possibleN);				
			}
		}
		// Run recursion
		maxPossibility = solveRecursion(possibleN, S, p, possibleT, 0, 0);
		return maxPossibility;
	}
	private int solveRecursion(int N, int S, int p, int t[], int surpriseScoreCount, int currN) {
		//System.out.println(currN+" "+t[currN]);
		if(currN>=N)
			return 0;
		int totalScore = t[currN];
		int possibility = 0;
		int highestPossible = 0;
		//Find possible combinations with max. score p
		for(int i=-10;i<=10;i++) {
			for(int j=-10;j<=10;j++) {
				for(int k=-10;k<=10;k++) {
					if(totalScore==(p+i+p+j+p+k))
					{
						//System.out.println("For:"+currN+" "+(p+i)+":"+(p+j)+":"+(p+k));
						if(isValid(p,p+i,p+j,p+k)) //Check if diff >2
						{
							if(isSurprise(p+i,p+j,p+k)) //Surprising score 
							{
								if(surpriseScoreCount+1 <= S)
								{
									//System.out.println("Surprise"+" For:"+currN+" "+(p+i)+":"+(p+j)+":"+(p+k));
									//Continue with recursion
									possibility = 1+solveRecursion(N, S, p, t, surpriseScoreCount+1, currN+1);
									if(possibility>highestPossible)
										highestPossible = possibility;
								}
							}
							else {
								//System.out.println("Possible"+" For:"+currN+" "+(p+i)+":"+(p+j)+":"+(p+k));
								//Continue with recursion
								possibility = 1+solveRecursion(N, S, p, t, surpriseScoreCount, currN+1);
								if(possibility>highestPossible)
									highestPossible = possibility;							
							}
						}
					}
				}
			}
		}
		if(highestPossible==0)
			highestPossible = solveRecursion(N, S, p, t, surpriseScoreCount+1, currN+1);
		return highestPossible;
	}
	private boolean isSurprise(int a, int b, int c)
	{
		return(Math.abs(a-b)==2||Math.abs(a-c)==2||Math.abs(b-c)==2);
	}
	private boolean isValid(int min, int a, int b, int c)
	{
		if(!(a>=min||b>=min||c>=min))
			return false;
		else if(a<0||b<0||c<0)
			return false;
		else if (a>10||b>10||c>10)
			return false;
		else
			return(!(Math.abs(a-b)>2||Math.abs(a-c)>2||Math.abs(b-c)>2));
	}	
}
