package codejam;

import fixjava.Pair;

public class Utils {

	public static long minLong(long firstVal, long... otherVals) {
		long minVal = firstVal;
		for (int i = 0; i < otherVals.length; i++)
			minVal = Math.min(firstVal, otherVals[i]);
		return minVal;
	}

	public static int minInt(int firstVal, int... otherVals) {
		int minVal = firstVal;
		for (int i = 0; i < otherVals.length; i++)
			minVal = Math.min(firstVal, otherVals[i]);
		return minVal;
	}

	public static float minFloat(float firstVal, float... otherVals) {
		float minVal = firstVal;
		for (int i = 0; i < otherVals.length; i++)
			minVal = Math.min(firstVal, otherVals[i]);
		return minVal;
	}

	/**
	 * ArgMin returned as a Pair<Integer, Integer>(index, value). Array must
	 * have at least one value.
	 */
	public static Pair<Integer, Integer> argMin(int[] arr) {
		int min = arr[0];
		int argMin = 0;
		for (int i = 1; i < arr.length; i++) {
			if (arr[i] < min) {
				min = arr[i];
				argMin = i;
			}
		}
		return new Pair<Integer, Integer>(argMin, min);
	}

	/**
	 * ArgMax returned as a Pair<Integer, Integer>(index, value). Array must
	 * have at least one value.
	 */
	public static Pair<Integer, Integer> argMax(int[] arr) {
		int max = arr[0];
		int argMax = 0;
		for (int i = 1; i < arr.length; i++) {
			if (arr[i] > max) {
				max = arr[i];
				argMax = i;
			}
		}
		return new Pair<Integer, Integer>(argMax, max);
	}

}

import java.util.*;

class Dancing
{
  public static int compute(int numGooglers, int numSurprising, int targetScore, int[]scores)
  {
    int count = 0;
    
    for(int i = 0; i < numGooglers; i++)
    {
      if(scores[i] >= targetScore && scores[i]/3 >= targetScore)
        count++;
      else if(scores[i] >= targetScore && scores[i]%3 > 0 && scores[i]/3 + 1 >= targetScore)
        count++;
      else if(scores[i] >= targetScore && numSurprising > 0 && scores[i]%3 == 0 && scores[i]/3 + 1 >= targetScore)
      {
        count++;
        numSurprising--;
      }
      else if(scores[i] >= targetScore && numSurprising > 0 && scores[i]%3 > 1 && scores[i]/3 + 2 >= targetScore)
      {
        count++;
        numSurprising--;
      }
    }
    
    return count;
  }
  
  public static void main(String[] args)
  {
    Scanner sc = new Scanner(System.in);
    int numCase, numSurprising, numGooglers, targetScore;
    int[] totalScores;
    
    numCase = sc.nextInt();
    
    for(int i = 0; i < numCase; i++)
    {
      numGooglers = sc.nextInt();
      numSurprising = sc.nextInt();
      targetScore = sc.nextInt();
      totalScores = new int[numGooglers];
      for(int j = 0; j < numGooglers; j++)
        totalScores[j] = sc.nextInt();
      
      System.out.println("Case #"+(i+1)+": "+compute(numGooglers, numSurprising, targetScore, totalScores));
    }
  }
}