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.BufferedOutputStream;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.Scanner;

class results {
	public int numgooglers,numsurprising,p,counter = 0;
	public int[] scores;
	HashMap<Integer,Integer> maxifnotsurprising, maxifsurprising;

	results(int numgooglers, int numsurprising, int p,HashMap<Integer,Integer> maxifnotsurprising, HashMap<Integer,Integer> maxifsurprising) {
		this.numgooglers = numgooglers;
		this.numsurprising = numsurprising;
		this.p = p;
		scores = new int[numgooglers];
		this.maxifnotsurprising = maxifnotsurprising;
		this.maxifsurprising = maxifsurprising;
	}
	public void addscore(int i) {
		scores[counter] = i;
		counter++;
	}
	public int maxgreaterthanp() {
		int max = 0;
		int remainingsurprising = numsurprising;
		for (int i=0;i<numgooglers;i++) {
			if (maxifnotsurprising.get(scores[i])>=p) max++;
			else if (remainingsurprising>0 && scores[i] > 1 ) { //If it's surprising, minimum score is 2
				if (maxifsurprising.get(scores[i])>=p) {
					max++;
					remainingsurprising--;
				}
			}
		}


		return max;
	}

}

public class DancingWithGooglers {

	final static String inputfile = "B-large.in",outfile = "output.txt";
	static HashMap<Integer,Integer> maxifnotsurprising,maxifsurprising;


	public static void main(String[] args) {
		maxifnotsurprising = new HashMap<Integer,Integer>(); 
		maxifsurprising = new HashMap<Integer,Integer>(); 

		for(int i=0;i<11;i++) {				//Smallest
			for (int j=i;j<i+3;j++){		//Middle
				for (int k=j;k<i+3;k++) {
					//System.out.println(i+","+j+","+k);
					int sum = i+j+k;
					if (k-i == 2) { 	   //Is surprising
						if (!maxifsurprising.containsKey(sum)) maxifsurprising.put(sum, k);
						else if (maxifsurprising.get(sum)<k) maxifsurprising.put(sum, k);
					}
					else {
						if (!maxifnotsurprising.containsKey(sum)) maxifnotsurprising.put(sum, k);
						else if (maxifnotsurprising.get(sum)<k) maxifnotsurprising.put(sum, k);
					}
				}
			}
		}
		ArrayList<results> cases = new ArrayList<results>();
		Scanner sc = null;
		try {
			sc = new Scanner(new File(inputfile));
		} catch (FileNotFoundException e) {
			System.err.println("OHONEZ");
		}
		int numtestcases = sc.nextInt();
		for (int i=0;i<numtestcases;i++) {
			results temp = new results(sc.nextInt(), sc.nextInt(), sc.nextInt(),maxifnotsurprising,maxifsurprising);
			for (int j=0;j<temp.numgooglers;j++) temp.addscore(sc.nextInt());
			cases.add(temp);
		}
		FileWriter fstream = null;
		try {
			fstream = new FileWriter(outfile);
			BufferedWriter out = new BufferedWriter(fstream);
			for (int i=0;i<cases.size();i++) {
				System.out.println("Case #"+(i+1)+": "+cases.get(i).maxgreaterthanp());
				out.write("Case #"+(i+1)+": "+cases.get(i).maxgreaterthanp()+"\n");
			}
			out.close();
		} catch (IOException e) {}

	}

}
