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.Scanner;
import java.io.File;
import java.io.FileNotFoundException;
import java.util.Arrays;

public class Dancing2
{
	public static void main(String[] args) throws FileNotFoundException
	{
		
		Scanner in = new Scanner(new File("B-large.in"));
		int numOfTests = Integer.parseInt(in.nextLine());
		
		for(int tests = 0; tests < numOfTests; tests++)
		{
			int googlers = in.nextInt();
			int specials = in.nextInt();  //Number of special cases
			int lookingFor = in.nextInt();  //Number it must contain at least
			
			int found = 0;
			int foundSpecials = 0;
			int[] googScores = new int[googlers];
			for(int googs = 0; googs < googlers; googs++)
			{
				googScores[googs] = in.nextInt();
			}
			Arrays.sort(googScores);
			for(int i = 0; i < googlers; i++)
			{
				
				int score = googScores[i];
				boolean completed = false;
				
				int[] scores = {lookingFor,lookingFor,lookingFor};
				if(scores[0] == 1)
				{
					scores[1] = 1;
					scores[2] = 1;
				}
				if(scores[0] == 0)
				{
					scores[1] = 0;
					scores[2] = 0;
				}
				while(!completed && specials != foundSpecials)
				{
					if((scores[0] + (scores[1]-2) + (scores[2]-2)) > score && scores[0] > 1)
						break;
					if(scores[0] < 2)
					{
						if(scores[0] > score)
							break;
					}
					if((scores[0] + (scores[1]-2) + (scores[2]-2)) == score && scores[0] > 1)
					{
						found += 1;
						foundSpecials += 1;
						completed = true;
						break;
					}
					if((scores[0] + (scores[1]-2) + (scores[2]-1)) == score && scores[0] > 1)
					{
						found += 1;
						foundSpecials += 1;
						completed = true;
						break;
					}
					if((scores[0] + (scores[1]-2) + (scores[2])) == score && scores[0] > 1)
					{
						found += 1;
						foundSpecials += 1;
						completed = true;
						break;
					}
					if((scores[0] + (scores[1]-1) + (scores[2]+1)) == score && scores[0] >= 1)//102
					{
						found += 1;
						foundSpecials += 1;
						completed = true;
						break;
					}
					if((scores[0] + (scores[1]) + (scores[2]+2)) == score ) //002
					{
						found += 1;
						foundSpecials += 1;
						completed = true;
						break;
					}
					if((scores[0] + (scores[1]+1) + (scores[2]+2)) == score) //012
					{
						found += 1;
						foundSpecials += 1;
						completed = true;
						break;
					}
					if((scores[0] + (scores[1]+2) + (scores[2]+2)) == score) //022
					{
						found += 1;
						foundSpecials += 1;
						completed = true;
						break;
					}
					scores[0] += 1;
					if (scores[0] >= 2)
					{
						scores[1] = (scores[0]);
						scores[2] = (scores[0]);
					}
					else
					{
						scores[1] = 1;
						scores[2] = 1;
					}
				}//end of while
				if((scores[0] + (scores[1]-1) + (scores[2]-1)) <= score && specials == foundSpecials && !completed)
				{
					found += 1;
				}
			}//end for(goog)
			System.out.println("Case #" + (tests+1) + ": " + found);
		}//end for(tests)
	}//end method
}//end class
					
				
				