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.BufferedReader;
import java.io.BufferedWriter;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;


public class DancingGooglers {

	/**
	 * @param args
	 */
	
	
	public int maxDancer(int N,int S,int p,int score[])
	{
		int maxNo=0;
		int q=p-1;
		int A,B,C;
		for (int i = 0; i < N; i++) {
			int X=score[i];
			
			A=X/3;
			B=(X-A)/2;
			C=X-(A+B);
			//System.out.println("X="+X+"A="+A+"B="+B+"C="+C);
			if(A>=p || B>=p || C>=p)
				maxNo++;
			else
			{
				if(S>0 && X!=0)
				{
					if(A==q)
					{
						if(B==q || C==q)
						{
							maxNo++;
							S--;
						}
					}
					else
					{
						if(B==q && C==q)
						{
							maxNo++;
							S--;
						}
							
					}
				}
			}
				
			
			
		}
		
		
		//System.out.println(maxNo);
		return maxNo;
	}
	
	
	
	
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		DancingGooglers dg=new DancingGooglers();
		
		FileInputStream fis = new FileInputStream("c:/small.txt");
        DataInputStream dis = new DataInputStream(fis);
        BufferedReader br = new BufferedReader(new InputStreamReader(dis));
        
        FileWriter fstream = new FileWriter("c:/out.txt");
        BufferedWriter out = new BufferedWriter(fstream);
               
        
        String str=br.readLine();
        int[] score=new int[100];
        int T=Integer.parseInt(str);
        int maxNo=0;
        int S=0,p=0;
        int caseNo=1;
        int N=0;
        while( (str = br.readLine()) != null && T>0) 
        {
        	if(caseNo>1)
        		out.newLine();
        	
        	String[] line=str.split(" ");
        	
        	N=Integer.parseInt(line[0]);
        	S=Integer.parseInt(line[1]);
        	p=Integer.parseInt(line[2]);
        	
        	
        	for (int i = 3,j=0; i < line.length; i++,j++) {
				
        		score[j]=Integer.parseInt(line[i]);
			}
        	maxNo=dg.maxDancer(N,S, p, score);
        	
        	out.write("Case #"+caseNo+": "+maxNo);
        	

        	caseNo++;
        	T--;
        }
		
        //Close the output stream
        out.close();
		

	}

}
