import java.util.*;
public class Test {
  public static void main(String[] args){
    Scanner in = new Scanner(System.in);
    int T = in.nextInt();

    for(int i = 1; i<=T; i++) {
      int n = in.nextInt();
      int s = in.nextInt();
      int p = in.nextInt();
      int result = 0;
      for(int j = 0; j<n; j++){
        int x = canAddUp(in.nextInt(), p);
        if(x == 0) {
          result++;
        } else if (x==1 && s > 0) {
          result++;
          s--;
        }
      }
      System.out.println("Case #"+i+": "+result);
    }
  }

  public static int canAddUp(int sum, int limit) {
    boolean flag = false;
    for(int i = 0; i<=sum; i++) {
      for(int j = 0; i+j <= sum; j++) {
        int k = sum-(i+j);
        int a = Math.abs(i-j);
        int b = Math.abs(i-k);
        int c = Math.abs(j-k);
        if(a > 2 || b > 2 || c> 2){
          continue;
        }

        if (i>=limit || j>=limit || k>=limit) {
          if(a < 2 && b < 2 && c < 2) {
            return 0;
          }else{
            flag = true;
          }
        }
      }
    }
    return (flag) ? 1 : 2;
  }
}

/**
 * 
 * @author slerig
 *
 */

import java.io.*;
import java.util.*;

public class ScoreChecker {

	/**
	 * @param args
	 * @throws FileNotFoundException 
	 */
	public static void main(String[] args) throws FileNotFoundException {
		File inFile = new File("B-large.in");
		PrintWriter outFile = new PrintWriter("B-large.out");
		Scanner in = new Scanner(inFile);
		
		int cases = in.nextInt();
		for(int i = 1; i <= cases; i++)
		{
			int googlers = in.nextInt();
			int surprising = in.nextInt();
			int minScore = in.nextInt();
			int googlersWithMin = 0;
			int[][] scores = new int[googlers][3];
			
			// Determining individual scores from total scores; before
			// surprising scores are taken into account.
			for(int j = 0; j < googlers; j++)
			{
				float score = in.nextLong();
				float ftemp = score / 3;
				int temp = (int)ftemp;
				if(ftemp - temp > 0.5)
				{
					scores[j][0] = temp + 1;
					scores[j][1] = temp + 1;
					scores[j][2] = temp;
				}
				else if(ftemp - temp > .25)
				{
					scores[j][0] = temp + 1;
					scores[j][1] = temp;
					scores[j][2] = temp;
				}
				else
				{
					for(int k = 0; k < 3; k++)
					{
						scores[j][k] = temp;
					}
				}
			}
			
			// Editing for surprising scores.
			for(int j = 0; j < googlers; j++)
			{
				// Very complicated way of deciding which scores are the surprising scores.
				if(surprising > 0 && scores[j][0] != 0 && scores[j][1] != 0 && scores[j][2] != 0)
					if(scores[j][0] != 10 && (scores[j][0] >= minScore-1 && scores[j][0] < minScore))
						if((scores[j][0] == scores[j][1]))
						{
							scores[j][0]++;
							scores[j][1]--;
							surprising--;
						}
			}
			
			// Checking for googlers with min score.
			for(int j = 0; j < googlers; j++)
			{
				if(scores[j][0] >= minScore)
					googlersWithMin++;
			}
			
			outFile.println("Case #" + i + ": " + googlersWithMin);
			
			/* Debugging code
			outFile.println();
			for(int j = 0; j < googlers; j++)
			{
				for(int k = 0; k < 3; k++)
				{
					outFile.print(scores[j][k] + " ");
				}
				outFile.println();
			}
			*/
		}
		outFile.close();
	}

}
