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);
        }
    }
}


/**
 * @(#)gcjB.java
 *
 *
 * @author
 * @version 1.00 2012/4/14
 */
import java.io.*;
public class gcjB {

    /**
     * Creates a new instance of <code>gcjB</code>.
     */
    public gcjB() {
    }

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        // TODO code application logic here






        int lineCount;
		String[] lines;
		try
		{


			BufferedReader in = new BufferedReader(new FileReader("B.in"));
			PrintWriter out = new PrintWriter(new FileWriter("B.out"));
			String text = in.readLine();
			lineCount = Integer.parseInt(text);
			lines = new String[lineCount];



		int x =0, y =0, z =0, sup =0;

        Integer[] maxs = new Integer[100];
        Integer[] maxws = new Integer[100];
        Integer matrix[][]  = new Integer[100][2];

        String surp = new String("");
        String norm = new String("");
        for(int i = 0; i < 100 ; i ++)
        {
        	maxs[i] = 0;
        	maxws[i] = 0;
			for(x=10;x>=0;x--)
			{
				for(y=x; y>=0;y--)
				{
					for(z=y;z>=0;z--)
					{
						if((x+y+z) == i)
						{
							if(delta(x, y, z) == 1)
							{
								//ah! surprized
								maxs[i] = java.lang.Math.max(maxs[i], maxi(x, y, z));
							}
							else if(delta(x, y, z) == 2)
							{
								//eh, not surprized
								maxws[i] = java.lang.Math.max(maxws[i], maxi(x, y, z));
							}
							else
							{
								//don't care
							}
						}
						else
						{
							//don't care
						}
					}
				}
			}

			matrix[i][0] = maxs[i];
			matrix[i][1] = maxws[i];
        }



			int Ng = 0 ;
			int Spz = 0;
			int NgMax = 0;

			int sx = 0;

			int MaxGo = 0;

			for(sx = 0; sx < lineCount; sx++)
			{
				String[] whatIsLeft;
				lines[sx] = in.readLine().trim();

				whatIsLeft = lines[sx].split(" ");

				Ng = Integer.parseInt(whatIsLeft[0]);
				Spz = Integer.parseInt(whatIsLeft[1]);
				NgMax = Integer.parseInt(whatIsLeft[2]);



				for(int i=3;i<whatIsLeft.length;i++)
				{
					if(Spz > 0)
					{
						if(matrix[Integer.parseInt(whatIsLeft[i])][1] >= NgMax)
						{
							MaxGo++;
						}
						else if(matrix[Integer.parseInt(whatIsLeft[i])][0] >= NgMax)
						{
							Spz--;
							MaxGo++;
						}
					}
					else
					{
						if(matrix[Integer.parseInt(whatIsLeft[i])][1] >= NgMax)
						{
							MaxGo++;
						}
					}

				}

				out.print("Case #"+(sx+1)+": "+MaxGo);
				if(sx < lineCount-1)
				{
					out.println();
				}
				MaxGo=0;
			}

			in.close();
			out.close();
		}
		catch(Exception e)
		{
			System.out.println(e);
		}
    }

    public static int delta(int x, int y, int z)
    {
    	if((java.lang.Math.abs(x-y) < 3) && ((java.lang.Math.abs(y-z)) < 3) && (java.lang.Math.abs(z-x) < 3))
    	{
	    	if((java.lang.Math.abs(x-y) ==2) || ((java.lang.Math.abs(y-z)) ==2) || (java.lang.Math.abs(z-x) ==2))
	    	{
	    		return 1;
	    	}
	    	else if((java.lang.Math.abs(x-y) < 2) || ((java.lang.Math.abs(y-z)) < 2) || (java.lang.Math.abs(z-x) < 2))
	    	{
	    		return 2;
	    	}
	    }
    	return 0;
    }
    public static int maxi(int x, int y, int z)
    {
     	int maxim = x;
     	maxim = java.lang.Math.max(maxim, y);
     	maxim = java.lang.Math.max(maxim, z);

     	return maxim;
    }
}
