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

public class B {

public static void main(String[] args)

	{
			Scanner in = new Scanner(System.in);
			
			int T = Integer.parseInt(in.nextLine());
			
			for (int test = 0 ; test < T ; test ++)
			{

				String input = in.nextLine();
				String[] bIn = input.split(" ");
				
				int googlersNum = Integer.parseInt(bIn[0]);
				int suprisingMax = Integer.parseInt(bIn[1]);
				int requirement = Integer.parseInt(bIn[2]);
				
				int okay=0;
				int suprising=0;
				
				for (int run = 0 ; run < googlersNum ; run ++)
				{
			
					int S = Integer.parseInt(bIn[3+run]);

					int temp = S;
					boolean testCase = false,done=false;
			
		
					for (int i = 10 ; i >= 0 ; i--)
					{
						for (int j =  i ; j >= i-1 && j >= 0; j--)
						{
							for (int k = i ; k >= i-1  && k >= 0; k --)
							{
									temp = temp - k  - i - j;

									if (temp == 0) 
									{ 
									
										if ((i >= requirement || j >= requirement || k >= requirement) && !done)
										{
											okay++;
											done = true;
										}
									
									}
									temp = S;
							}
						}
					}	
				
					temp = S;
				
					if (!testCase && suprising < suprisingMax)
					{
						for (int i = 10 ; i >= 0 ; i--)
						{
							for (int j = i ; j >= i-2 && j >= 0 ; j--)
							{
								for (int k = i ; k >= i-2  && k >= 0 ; k--)
								{
									temp = temp - i - k - j;
									if (temp == 0) 
									{ 
										if ((i >= requirement || j >= requirement || k >= requirement) && !done)
										{
											testCase = true;
											suprising++;
											okay++;
											done = true;
										}
									
									}
									temp = S;

								}
							}
						}
					}
				}
				
				System.out.println("Case #"+(test+1)+": "+okay);
			}
					
			in.close();
	}
	
}
			
			