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

public class gcj2 {
	static int T; // tesztesetek szÃ¡ma
	static int N[]; // Googlerek szÃ¡mai
	static int S[]; // meglepÅ tripletek szÃ¡ma
	static int p[]; // pÃ©k
	static int total[][]; // Ã¶sszpontszÃ¡mok
	static int tripletek[][];
	
	
	static void beolvas (String f) throws IOException {
		BufferedReader be = new BufferedReader(new FileReader(f));
		String sor = be.readLine();
		T = Integer.parseInt(sor);
		N = new int[T];
		S = new int[T];
		p = new int[T];
		tripletek = new int[T][3];
		for (int i = 0; i < T; i++) {
			sor = be.readLine();
			String nums[] = sor.split(" ");
			N[i] = Integer.parseInt(nums[0]);
			S[i] = Integer.parseInt(nums[1]);
			p[i] = Integer.parseInt(nums[2]);
		}
		be.close();
		
		int Nmax = N[0];
		for (int j = 0; j < T; j++){
			if (N[j] > Nmax) Nmax = N[j];
		}
		total = new int[T][Nmax];
		BufferedReader be2 = new BufferedReader(new FileReader(f));
		sor = be2.readLine();
		for (int i = 0; i < T; i++) {
			sor = be2.readLine();
			String nums[] = sor.split(" ");
			for (int j = 0; j < N[i]; j++) {
				total[i][j] = Integer.parseInt(nums[3+j]);
			}
		}
		be2.close();
	}
	
	static void kiir () {
		System.out.println(T);
		for (int i = 0; i < T; i++) {
			System.out.print(N[i]+" "+S[i]+" "+p[i]+" ");
			for (int j = 0; j < N[i]; j++) {
				System.out.print(total[i][j]+" ");
			}
			System.out.println();
		}
	}
	
	static int count (int a) {
		int er = 0;
		int surp = S[a];
		for (int i = 0; i < N[a]; i++) {
			if (total[a][i] >= (3*p[a])-2) {
				er++;
			} else {
				if (surp > 0 && total[a][i] >= (p[a]+2*(p[a]-2)) && p[a] > 1) {
					er++;
					surp--;
				}
			}
		}
		return er;
	}
	
	public static void main (String args[]) throws IOException {
		beolvas("B-large.in");
		// kiir();
		for (int a = 0; a < T; a++) {
			System.out.println("Case #"+(a+1)+": "+count(a));
		}
	}
}

