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.util.ArrayList;
import java.util.Arrays;
import java.util.Scanner;


public class DancingWithTheGooglers {
	public static void main(String[] args){
		Scanner keyin=new Scanner(System.in);
		int T=keyin.nextInt();
		int caseCount=0;
		while ((T--)>0){
			int N=keyin.nextInt();
			int S=keyin.nextInt();
			int P=keyin.nextInt();
			int[] googler=new int[N];
			for (int i=0; i<N; i++){
				googler[i]=keyin.nextInt();
			}
			caseCount++;
			ArrayList<int[][]> googlerScore=new ArrayList<int[][]>();
			
			for (int index=0; index<googler.length; index++){
				int remainder=googler[index];
				int[] arrayInit=new int[3];
				for (int i=3; i>0; i--){
					int temp=remainder/i;
					remainder-=temp;
					arrayInit[3-i]=temp;
				}
				int[][] arrayScore=new int[2][3];
				arrayScore[0]=arrayInit;
				if (arrayInit[0]==arrayInit[1] && arrayInit[1]==arrayInit[2]){
					int[] temp={arrayInit[0]-1,arrayInit[1],arrayInit[2]+1};
					arrayScore[1]=temp;
				}
				else if (arrayInit[0]==arrayInit[1] && arrayInit[1]!=arrayInit[2]){
					int[] temp={arrayInit[0]-1,arrayInit[1]+1,arrayInit[2]};
					arrayScore[1]=temp;
				}
				else if (arrayInit[0]!=arrayInit[1] && arrayInit[1]==arrayInit[2]){
					int[] temp={arrayInit[0],arrayInit[1]-1,arrayInit[2]+1};
					arrayScore[1]=temp;
				}
				//System.out.println(Arrays.deepToString(arrayScore));
				googlerScore.add(arrayScore);
			}
			
			int result=N;
			for (int index=0; index<googlerScore.size(); index++){
				if (googlerScore.get(index)[0][2]<P){
					if (googlerScore.get(index)[1][2]<P){
						result--;
					}
					else {
						if (S>0 && googlerScore.get(index)[1][0]<0){
							S--;
							result--;
							//System.out.println("S R "+S+" "+result);
						}
						else if (S>0){
							S--;
							//System.out.println("S "+S);
						}
						else if (S<=0) {
							result--;
							//System.out.println("R "+result);
						}
					}
				}
			}
			System.out.println("Case #"+caseCount+": "+result);
		}
	}
}
