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.ArrayList;
import java.util.Scanner;


public class GooglersDancing {
	
	public static int[][] array = new int[11][4];
	
	public void generateArray() {
		for (int i=0;i<=10; i++) {
			array[i][0] = Integer.MAX_VALUE;
			array[i][2] = Integer.MAX_VALUE;
			array[i][1] = Integer.MIN_VALUE;
			array[i][3] = Integer.MIN_VALUE;
			//ArrayList<Integer> possibleList = new ArrayList<Integer>();
			for (int j=i-2; j<=i+2 ; j++) {
				if (j>=0 && j<=10) {
					if (Math.abs(j-i) < 2) {
						if (array[i][2] > (j+j)) {
							array[i][2] = j+j;
						}
						else if (array[i][3] < (j+j)) {
							array[i][3] = j+j;
						}
						if (array[i][0] > (j+j)) {
							array[i][0] = j+j;
						}
						else if (array[i][1] < (j+j)) {
							array[i][1] = j+j;
						}
					}
					else {
						if (array[i][0] > (j+j)) {
							array[i][0] = j+j;
						}
						else if (array[i][1] < (j+j)) {
							array[i][1] = j+j;
						}
					}
				}
			}
		}
	}
	
	public static void main(String[] args) {
		GooglersDancing g = new GooglersDancing();
		g.generateArray();
		for (int i=0; i<=10; i++) {
			System.out.println(i + ":" + array[i][0] + "*" + array[i][1] + "*" + array[i][2] + "*" + array[i][3] + "*");
		}
		
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		int cases=1;
		while (cases <= T) {			
			int N,S,p, count=0;
			N = in.nextInt();
			S = in.nextInt();
			p = in.nextInt();
			while (N-->0) {
				boolean inRange=false, outRange=false;
				int t = in.nextInt();
				int p2 = p;
				while (p2<=10) {
					int sum = t-p2;
					if (sum >= array[p2][2] && sum <= array[p2][3]) {
						inRange = true;
						break;
					}
					else if (sum >= array[p2][0] && sum <= array[p2][1]) {
						outRange = true;
					}
					p2++;
				}
				if (inRange) {
					count++;
				}
				else if (outRange && S>0) {
					count++;
					S--;
				}
			}
			System.out.println("Case #" + cases + ": " + count);
			cases++;
		}
	}

}
