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.*;
import java.util.*;

class googledance {
  public static void main (String [] args) throws IOException {
	  
    BufferedReader f = new BufferedReader(new FileReader("googledance.in"));
    
    PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("googledance.out")));
    
    int n = Integer.parseInt(f.readLine());
    
    String[] scores = new String[n];
    int[] answers = new int[n];
    
    for(int i=0; i<n; i++){
    	scores[i] = f.readLine();
    	answers[i] = 0;
    }
    
    for(int i=0; i<n; i++){
    	
        StringTokenizer st = new StringTokenizer(scores[i]);
        
        int numgooglers = Integer.parseInt(st.nextToken());
        int numsurprises = Integer.parseInt(st.nextToken());
        int threshold = Integer.parseInt(st.nextToken());
        
        Integer[] sumscores = new Integer[numgooglers];
        int[][] breakdown = new int[numgooglers][3];
        boolean[] succeeded = new boolean[numgooglers];
        
        for(int j=0; j<numgooglers; j++){
        	
        	sumscores[j] = Integer.parseInt(st.nextToken());
        }
        
        Arrays.sort(sumscores, Collections.reverseOrder()); //sort DESCENDING
        
        for(int j=0; j<numgooglers; j++){
        	
        	//System.out.println();
        	
        	int psum = 0;
        	
        	for(int k=0; k<3; k++){
        		breakdown[j][k] = sumscores[j]/3;
        		psum += sumscores[j]/3;
        	}
        	
        	if (psum!=sumscores[j]){
        		int deviation = psum-sumscores[j];
        		
        		for(int k=0; k<Math.abs(deviation); k++){ //Notice that there will be AT MOST 2 deviations!
        			
        			if(deviation > 0){ //balance out the deviations as closely as possible
        				breakdown[j][k]--;
        			}
        			else{
        				breakdown[j][k]++; //good news, the breakdown is always sorted from inc->dec
        			}
        			
        		}
        		
        	}
        	
        	/*for(int k=0; k<3; k++){
        		System.out.println(breakdown[j][k]);
        	}*/
        	
        }
        
        for(int j=0; j<numgooglers; j++){
        	
        	for(int k=0; k<3; k++){
        		if(!succeeded[j] && breakdown[j][k]>= threshold){
        			answers[i]++;
        			succeeded[j] = true;
        			
        			break;
        		}
        	}
        	
        }
        
        for(int j=0; j<numgooglers; j++){
            	
           if(!succeeded[j] && numsurprises>0){
            		
        	   if((breakdown[j][0]+2-breakdown[j][1] > 2) || (breakdown[j][0]+1>10) || (breakdown[j][1]-1<0)) //greater than 2 is an impossible surprise
        		   continue;
        	   
        	   breakdown[j][1]--;
        	   breakdown[j][0]++;
        	   
        	   numsurprises--;
            }

        }
        
        for(int j=0; j<numgooglers; j++){
        	
        	for(int k=0; k<3; k++){
        		if(!succeeded[j] && breakdown[j][k] >= threshold){
        			answers[i]++;
        			succeeded[j] = true;
        			
        			break;
        		}
        	}
        	
            /*for(int k=0; k<3; k++){
        		System.out.println(breakdown[j][k]);
               }*/
        	
        }

    }
    
    for(int i=0; i<n; i++){
    	out.println("Case #" + (i+1) + ": " + answers[i]);
    }
    
    out.close();                                  
    
    System.exit(0);                             
  }
}
