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.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Vector;


public class question2CodeJam {
	public int N = 0;
	public int S = 0;
	public int P = 0;
	Vector<Integer> Scores = new Vector<Integer>();
	public int scoreValidCount=0; 
	public int computeAtLeastP(){
		
		for(int i=0;i<N;i++){
			
			int currentScore = Scores.get(i);
			if(currentScore%3==0){
				int minVal = currentScore/3;
				if(minVal>=P){
					scoreValidCount++;
					continue;
				}
				if(minVal == 0 && P == 0){
					scoreValidCount++;
					continue;
				} else if (minVal==0 && P!= 0){
					continue;
				}
				if((minVal+1) >= P && S > 0){
					//minVal + 1 would introduce 2 ka gap
					scoreValidCount++;
					S--;
					continue;
				}
			}
			if(currentScore%3==1){
				int minVal = currentScore/3;
				if(minVal>=P){
					scoreValidCount++;
					continue;
				}
				if((minVal+1) >= P){
					scoreValidCount++;
					continue;
				}
			}
			if(currentScore%3==2){
				int minVal = currentScore/3;
				if((minVal+1) >= P){
					scoreValidCount++;
					continue;
				}
				if(((minVal+2) >= P)&&(S>0)){
					S--;
					scoreValidCount++;
					continue;
				}
			}
			
		}
		return (int) scoreValidCount;
	}
	public static void main(String[] args){
		
	    try{
		    File file = new File(args[0]);
		    
		    FileWriter fstream = new FileWriter(args[1]);
		    BufferedWriter out = new BufferedWriter(fstream);
		    
		    BufferedReader in = new BufferedReader(new FileReader(file));
		    
		    String line = in.readLine();
		    //here line is the number of rounds
		    int counter=0;
		    int testCase = Integer.parseInt(line);
		    
		    while (counter<testCase) {
		    	question2CodeJam tmp = new question2CodeJam();
		    	String inline = in.readLine();
		    	String[] val = inline.split(" ");
		    	
		    	//initializing
		    	tmp.N = Integer.parseInt(val[0]);
		    	tmp.S = Integer.parseInt(val[1]);
		    	tmp.P = Integer.parseInt(val[2]);
		    	for(int i=3;i<val.length;i++){
		    		tmp.Scores.add(Integer.parseInt(val[i]));
		    	}
		    	
		    	++counter;
		    	//System.out.println("Case #" + counter + ": " + tmp.computeAtLeastP());
		    	//out.write(inline);
		    	out.write("Case #" + counter + ": " + tmp.computeAtLeastP());
		    	out.write("\n");
	    	}
		    out.close();
		    in.close();
	    }
	    catch(IOException e){
	    	
	    	System.out.println("IO Error");
	    }
	    catch (ArrayIndexOutOfBoundsException e){
	    	System.out.println("Array Error");
	    	e.printStackTrace();
	    }
		
	}

}
