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.StringTokenizer;

public class q2
{
	public static int spl,threshold,players,output;
	public static void main(String []args) throws IOException
	{
		
		 PrintWriter pw=new PrintWriter(new BufferedWriter(new FileWriter("output.txt")));
	   BufferedReader br=new BufferedReader(new FileReader("input.txt"));
		
		int arr[]=new int[107];
		 int limit=Integer.parseInt(br.readLine());
		 String x1;
		 String word="";
		 for(int li=1;li<=limit;li++)
	   {
	   	   x1=br.readLine();
	   	  int j=0;
	   	   StringTokenizer st =new StringTokenizer(x1);
	   	   while (st.hasMoreElements()) {

              String token = st.nextElement().toString();
               arr[j]=Integer.parseInt(token);
                 j++;
           }
            
            spl=arr[1];
            threshold=arr[2];
            players=arr[0];  
	   	    output=find(arr);
	        pw.println("Case #"+li+": "+output);
	   arr=new int[107];
	   }
	    pw.close();
  }
	
	public static int find(int arr[])
	{
		int a=0,b=0,c=0;
		int op=0;	
		for(int i=3;i<(players+3);i++)
		{
		   int num=arr[i];
		   int num2=num;
		   boolean check=true;
	  	a=num/3;
	     b=a;
		c=a;
		int diff=num2-(a*3);
			
		if(diff==0)
		{   if(a>=threshold||b>=threshold||c>=threshold)
	 	      op++;
	 	else
	 	 { 	 	
	 	 	if(spl>0)
	 	 	{
	 	 	 	if((a-1)>0)
	 	      	{
	 	 	 	 	if((a-1)>=threshold||b>=threshold||(c+1)>=threshold)
	 	             {
	 	             	  op++;
	 	                   spl--;
	 	              }
	 	         }
	 	      }
	 	   }
	 	 
		 }
		
		 if(diff==1)
		 { 	 if((a+1)>=threshold||b>=threshold||c>=threshold)
	 	       {      op++;
	 	        }
	 	       
	 	       else
	 	 { 	 	
	 	 	if(spl>0)
	 	 	{
	 	 	  	 	if((a+1)>=threshold||(b-1)>=threshold||(c+1)>=threshold)
	 	             {
	 	             	  op++;
	 	                   spl--;
	 	              }
	 	         
	 	      }
	 	   } 
	 	        
	 	 }
	     if(diff==2)
	     {	 
	 	      if((a+1)>=threshold||(b+1)>=threshold||c>=threshold){
	 	  	 op++;
	 	 }
	 	 else
	 	 { 	if(spl>0)
	 	 	{
	 	 	   if((a+2)>=threshold||b>=threshold||c>=threshold)
	 	        { 
	 	          op++;
	 	           spl--;
	 	      }
	 	   }
	 	 }
	 	 
	 	 }
	 	 }
	     
	    return op;
	}
}