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

public class DancingWithGooglers {

  public static class Googlers {

    public int T;
    public int surp;
    public boolean surprising;
    public boolean pSurprising;
    public boolean antiSurprising;
    public boolean pAntiSurprising;

    public Googlers(int T, int surp) {
      this.T = T;
      this.surp = surp;
    }

    public void set(int a, int b, int c) {
      if (c >= 0 && (a + b + c) == T) {
        int diff = (Math.max(a, Math.max(b, c)) - Math.min(a, Math.min(b, c)));
        if (diff <= 2) {
          if (diff == 2) {
            if (a >= surp || b >= surp || c >= surp) {
              pSurprising = true;
            } else {
              surprising = true;
            }
          } else {
            if (a >= surp || b >= surp || c >= surp) {
              pAntiSurprising = true;
            } else {
              antiSurprising = true;
            }
          }
        }
      }
    }
  }

  public static void main(String... args) throws IOException {
//    BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
    BufferedReader reader = new BufferedReader(new FileReader("B-large.in"));
//    PrintWriter writer = new PrintWriter(System.out);
    PrintWriter writer = new PrintWriter("B-large.out");

    int len, cases = Integer.parseInt(reader.readLine());
    List<Googlers> satisfied = new ArrayList<Googlers>();
    List<Googlers> unsatisfied = new ArrayList<Googlers>();
    String[] inputs;
    int N, S, p;
    for (int i = 1; i <= cases; i++) {
      inputs = reader.readLine().split(" ");
      p = Integer.parseInt(inputs[1]);
      S = Integer.parseInt(inputs[2]);
      satisfied.clear();
      unsatisfied.clear();
      for (int j = 3; j < inputs.length; j++) {
        int t = Integer.parseInt(inputs[j]);
        Googlers googlers = new Googlers(t, S);

        for (int k = 0; k <= 10; k++) {
          int till = k + 2 > 10 ? 10 : k + 2;
          for (int l = k; l <= till; l++) {
            googlers.set(k, l, (t - (k + l)));
          }
        }
        if (googlers.pAntiSurprising) {
          satisfied.add(googlers);
        } else {
          unsatisfied.add(googlers);
        }
      }
      int pSurprising = 0;
      if (p > 0) {
        for (Iterator<Googlers> iter = unsatisfied.iterator(); iter.hasNext(); ) {
          Googlers googlers = iter.next();
          if (googlers.pSurprising) {
            pSurprising++;
            iter.remove();
            p--;
            if (p <= 0) break;
          }
        }
      }
      if(p > 0){
        for (Iterator<Googlers> iter = unsatisfied.iterator(); iter.hasNext(); ) {
          Googlers googlers = iter.next();
          if (googlers.surprising) {
            iter.remove();
            p--;
            if (p <= 0) break;
          }
        }
      }
      if(p > 0){
        for (Iterator<Googlers> iter = satisfied.iterator(); iter.hasNext(); ) {
          Googlers googlers = iter.next();
          if (googlers.pSurprising) {
            iter.remove();
            pSurprising++;
            p--;
            if (p <= 0) break;
          }
        }
      }
      if(p > 0){
        for (Iterator<Googlers> iter = satisfied.iterator(); iter.hasNext(); ) {
          Googlers googlers = iter.next();
          if (googlers.surprising) {
            iter.remove();
            p--;
            if (p <= 0) break;
          }
        }
      }

      if(p > 0){
        writer.print("Case #" + i + ": 0");
      }else {
        writer.print("Case #" + i + ": " + (satisfied.size() + pSurprising));
      }
      writer.println();
    }
    writer.flush();
  }


}

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


public class DancingWithTheGooglers {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		
		
        File file = new File("data/B-large.in");
        
        
        try {
            
        	Scanner scanner = new Scanner(file);
            
        	int numOfLines = scanner.nextInt();

        	scanner.nextLine();
        	
        	

        	
        	for (int i = 0; i < numOfLines; i++) {
        	
            	int NumOfGooglers = 0;
            	int NumOfSurprisingTriplet = 0;
            	int BestResultTreshold = 0;
            	
            	int NumOfGooglersMeetingTreshold = 0;
            	
        		// Read number of Googlers
        		NumOfGooglers = scanner.nextInt();
        		//System.out.println(NumOfGooglers);
        		
        		NumOfSurprisingTriplet = scanner.nextInt();
        		
        		BestResultTreshold  = scanner.nextInt();
        		
        		
        		int result[];
        		for (int j = 0; j < NumOfGooglers; j++) {
        			
        			int currResult = scanner.nextInt();
        			
        			if (currResult < (BestResultTreshold/3)) {
        				// No way, don't bother
        				continue;
        			}
        			
        			result = getPossibleCombinations(currResult);
//        			System.out.println("Max Not Surprising: " + result[0]);
//        			System.out.println("Max Surprising: " + result[1]);
        			
        			
        			if (result[0] >= BestResultTreshold) {
        				NumOfGooglersMeetingTreshold++;
        			} else if (result[1] >= BestResultTreshold && NumOfSurprisingTriplet > 0) {
        				NumOfGooglersMeetingTreshold++;
        				NumOfSurprisingTriplet--;
        			}
        			
        			
        		}
        		
        		
        		System.out.println("Case #" + (i+1) + ": " + NumOfGooglersMeetingTreshold);
        		
        	}
        	
        	
        } catch (FileNotFoundException e) {
            e.printStackTrace();
        }
		
		
		
/*		
        int result[] = getPossibleCombinations(5);
		System.out.println("Max Not Surprising: " + result[0]);
		System.out.println("Max Surprising: " + result[1]);*/

		
	}
	
	public static int[] getPossibleCombinations(int totalScore) {
		
		
		int indivMax = (int) Math.ceil( Math.min( ((double)totalScore/3.0) , 9)) ;
		indivMax = indivMax + 1;
		
		int i = indivMax;
		int indivMin = i - 3;
		
		
		int maxValueNotSurprising = 0;
		int maxValueSurprising = 0;
		
		
		// First start with indivMax
		for (; i >= indivMin; i--) {
		
			
			int currMin = Math.max(i-2, 0);
			for (int j = i; j >= currMin; j--) {
				
				
				for (int k = j; k >= currMin; k--) {
					
					
					if (i+j+k == totalScore) {
//						System.out.print("Found: " + i + " " + j + " " + k);
						
						if (i-k == 2) {
							if (i > maxValueSurprising) maxValueSurprising = i;
//							System.out.print(" (*)");
						} else {
							if (i > maxValueNotSurprising) maxValueNotSurprising = i;
						}
						
//						System.out.println();
					}
					
				}
				
			}
		}
		
		int[] output = {maxValueNotSurprising, maxValueSurprising}; 
		return output;
		
	}

}
