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.FileNotFoundException;
import java.io.FileReader;
import java.io.LineNumberReader;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Iterator;
import java.util.List;
import java.util.Map;
import java.util.TreeMap;
public class DancingGooglers {
	public static final int MAX_SCORE = 10;
	public static final int MIN_SCORE = 0;
	public static final int MAX_TOTAL = 30;
	public static final int MIN_TOTAL = 0;
	private Map<Integer,Integer> normal;
	private Map<Integer,Integer> surprising;
	private List<Integer> normals;
	public DancingGooglers() {
		int i=0;
		normal = new TreeMap<Integer, Integer>();
		surprising = new TreeMap<Integer, Integer>();
		normals = new ArrayList<Integer>();
		normal.put(0, 0); 
		surprising.put(0, 0); 
		for(i=MIN_TOTAL+1;i<=MAX_TOTAL;i++) {
			int base = i/3;
			int mod = i%3;
			List<Integer> scores = new ArrayList<Integer>();
			switch(mod) {
			case 0:
				scores.add(base);
				normal.put(i, Collections.max(scores));
				scores.add(Math.max(0, base-1));
				scores.add(Math.min(10, base+1));
				surprising.put(i, Collections.max(scores)); 
				break;
			case 1:
				scores.add(base);
				scores.add(Math.min(10, base+1));
				normal.put(i, Collections.max(scores));
				scores.add(Math.max(0, base-1));
				surprising.put(i, Collections.max(scores)); 
				break;
			case 2:
				scores.add(base+1);
				scores.add(Math.max(0, base));
				normal.put(i, Collections.max(scores));
				scores.add(Math.min(10, base+2));
				surprising.put(i, Collections.max(scores)); 
				break;
			}
			if(surprising.get(i).equals(normal.get(i))) {
				normals.add(i);
			}
		}
		System.out.println(normal);
		System.out.println(surprising);
		System.out.println(normals);
	}
	public List<Integer> surprising(List<Integer> numbers, int p) {
		List<Integer> surprising = new ArrayList<Integer>();
		for (Integer n : numbers) {
			if(!normals.contains(n) && this.surprising.get(n)>=p && this.normal.get(n)<p) {
				surprising.add(n);
			}
		}
		return surprising;
	}
	public int solve(List<Integer> numbers, int S, int p) {
		int result = 0;
		List<Integer> listSS = surprising(numbers,p);
		int SS = listSS.size();
		Iterator<Integer> i = numbers.iterator();
		if(SS==S || S>SS) { // take all the surprising
			while(i.hasNext()) {
				int n = i.next();
				if(listSS.contains(n) && surprising.get(n)>=p) {
					System.out.println("score: "+surprising.get(n));
					result++;
				}
				else if(normal.get(n)>=p) {
					System.out.println("score: "+normal.get(n));
					result++;
				}
				else {
					System.out.println("score: "+normal.get(n));
				}
			}
		}
		else if(S<SS) { // choose the p best!!!
			result += S;
			while(i.hasNext()) {
				int n = i.next();
				System.out.println("score: "+normal.get(n));
				if(normal.get(n)>=p) {
					result++;
				}
			}
		}else if(S==0) { // take all as normals
			while(i.hasNext()) {
				int n = i.next();
				if(normal.get(n)>=p) {
					result++;
				}
			}
		}
		return result;
	}
	public static void main(String[] args) throws Exception {
		DancingGooglers dg = new DancingGooglers();
		LineNumberReader in = new LineNumberReader(new FileReader(args[0]+".in"));
		String line = null;
		line = in.readLine();
		if(line==null||line.length()==0)
			return;
		int T = 0;
		T = Integer.parseInt(line);
		PrintStream out = new PrintStream(args[0]+".out");
		for(int i=1; i<=T; i++){
			line = in.readLine();
			String[] data = line.split(" ");
			int N = Integer.valueOf(data[0]);
			int S = Integer.valueOf(data[1]);
			int p = Integer.valueOf(data[2]);
			List<Integer> numbers = new ArrayList<Integer>();
			for(int j=0; j<N; j++) {
				numbers.add(Integer.parseInt(data[3+j]));
			}
			StringBuffer buf = new StringBuffer();
			buf.append("Case #");
			buf.append(i);
			buf.append(": ");
			buf.append(dg.solve(numbers, S, p));
			out.println(buf.toString());
			System.out.println(line);
			System.out.println(buf.toString());
//			System.out.println("Numbers: " +numbers);
//			System.out.println("Surprising: " +dg.surprising(numbers,p));
//			System.out.println("S: " +S);
//			System.out.println("p: " +p);
		}
		in.close();
		out.close();
	}
}
