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.BufferedReader;
import java.io.FileReader;
import java.util.ArrayList;
import java.util.List;

public class ClientB {

	public static void main(String args[]) throws Exception {
		ClientB client = new ClientB();
		String[] inputLines = client.getInputLines(args[0]);

		int lineCount = Integer.valueOf(inputLines[0]);

		for(int i = 1; i <= lineCount; i++) {
			String currentLine = inputLines[i];
			String[] currentCase = currentLine.split(" ");
			
			int numOfGooglers = Integer.valueOf(currentCase[0]);
			int numOfSuprisingScoreTriplets = Integer.valueOf(currentCase[1]);
			int numOfBestResultGtEq = Integer.valueOf(currentCase[2]);
			
			System.out.println("Min or better: " + numOfBestResultGtEq);
			System.out.println("sup: " + numOfSuprisingScoreTriplets);
			
			List<int[]> baseScores = new ArrayList<int[]>();
			for(int j = 0; j < numOfGooglers; j++) {
				baseScores.add(client.fillScores(Integer.valueOf(currentCase[3+j])));
			}
			
			int[] processedScores = client.categorizeScores(baseScores, numOfBestResultGtEq);
			
			int sol = processedScores[0] + Math.min(numOfSuprisingScoreTriplets, processedScores[1]);
			
			System.out.println("Case #" + i + ": " + sol);
			System.out.println();
		}
	}

	private int[] categorizeScores(List<int[]> scores, int bar) {
		int[] cat = {0, 0, 0}; //Good, bad, no potential (of being counted)
		
		for(int[] eachScoreSet : scores) {
			int maxScore = eachScoreSet[1]; //by def of fillScores alg
						
			if(maxScore >= bar) {
				cat[0]++;
			} else if(maxScore+1 == bar) {
				int oth = Math.max(eachScoreSet[0], eachScoreSet[2]);
				if(oth-1 >= 0 && (maxScore+1) - (oth-1) <= 2) {
					cat[1]++;
				} else {
					cat[2]++;
				}
			} else { //no hope
				cat[2]++;
			}
		}
		
		return cat;
	}
	
	private int[] fillScores(int maxValue) {
		int[] scores = {0, 0, 0};
		int totScore = 0;
		while(++totScore <= maxValue) {
			scores[totScore % 3]++;
		}
		System.out.println("maxVal:" + maxValue +" {"+scores[0]+","+scores[1]+","+scores[2]+"}");
		return scores;
		
	}
	
	private String[] getInputLines(String fileName) throws Exception {
		BufferedReader reader = new BufferedReader(new FileReader(fileName));
		List<String> lines = new ArrayList<String>();
		String nextLine;
		while((nextLine = reader.readLine()) != null) {
			lines.add(nextLine);
		}
		return lines.toArray(new String[lines.size()]);
	}

}
