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



public class DancingWithTheGooglers {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		if(args.length < 1)
			return;
		
		String inputFileName = args[0];
		File inputFile = new File(inputFileName);
		
		
		BufferedReader in = null;
		try {
			in = new BufferedReader(new FileReader(inputFile));
		} catch (FileNotFoundException e) {
			e.printStackTrace();
			System.out.println("File not found: "+inputFileName);
			return;
		}
		
		
		String line = null;
		try {
			line = in.readLine();
		} catch (IOException e) {
			e.printStackTrace();
			System.out.println("First line nonexistent: "+inputFileName);
			return;
		}
		
		int numCases = Integer.parseInt(line);
		
		for(int i = 1; i <= numCases; i++){
			try {
				line = in.readLine();
			} catch (IOException e) {
				e.printStackTrace();
				System.out.println("Input ran out at line "+ i +" of "+ numCases);
				return;
			}
			
			String[] ins = line.split(" ");
			
			int gs = Integer.parseInt(ins[0]);
			int surps = Integer.parseInt(ins[1]);
			int min = Integer.parseInt(ins[2]);
			
			int capable = 0;
			for(int j = 0; j < gs; j++){
				int cur = Integer.parseInt(ins[3+j]);
				
				if(cur / 3 >= min)
					capable++;
				else if((min-1 >= 0) && (cur/3 == (min-1)) && (cur%3 > 0))
					capable++;
				else if(surps > 0 && (min-2 >= 0) && (cur/3 >= (min-2)) && (cur %3 > 1)){
					capable++;
					surps--;
				} else if(surps > 0 && (min-2 >= 0) && (cur/3 >= (min-1))){
					capable++;
					surps--;
				}
			}
			
			StringBuilder ob = new StringBuilder();
			ob.append("Case #").append(i).append(": ");
			ob.append(capable);
			System.out.println(ob.toString());
		}
		
//		String inp = "3 3 8 3 21 13";
//		
//		String[] ins = inp.split(" ");
//		
//		int gs = Integer.parseInt(ins[0]);
//		int surps = Integer.parseInt(ins[1]);
//		int min = Integer.parseInt(ins[2]);
//		
//		int capable = 0;
//		
//		for(int j = 0; j < gs; j++){
//			int cur = Integer.parseInt(ins[3+j]);
//			
//			System.out.println("cur/3: "+(cur/3));
//			System.out.println("cur%3: "+(cur%3));
//			
//			if(cur / 3 >= min)
//				capable++;
//			else if((min-1 >= 0) && (cur/3 == (min-1)) && (cur%3 > 0))
//				capable++;
//			else if(surps > 0 && (min-2 >= 0) && (cur/3 >= (min-2)) && (cur %3 > 1)){
//				capable++;
//				surps--;
//			} else if(surps > 0 && (min-2 >= 0) && (cur/3 >= (min-1))){
//				capable++;
//				surps--;
//			}
//		}
//		System.out.println(capable);
	}
}
