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.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;


public class ProblemB {
	public int[] deriveScores(int totalScore) {
		if (totalScore < 0 || totalScore > 30) {
			throw new IllegalArgumentException("invalid totalScore passed: " + totalScore);
		}
		
		int n = totalScore / 3;
		int r = totalScore % 3;
		int[] scores = new int[3];
		
		scores[0] = n;
		scores[1] = n + r / 2;
		scores[2] = n + r - (r / 2);
		
//		if (n == 0) {
//			if (surprise) {
//				scores[2] += r;
//			} else {
//				scores[1] += r / 2;
//				scores[2] += r - (r / 2);
//			}
//		} else if (n == 9) {
//			scores[1] += r / 2;
//			scores[2] += r - (r / 2);
//		} else if (0 < n && n < 9) {
//			if (surprise) {
//				if (r == 0) {
//					scores[0]--;
//					scores[2]++;
//				} else if (r == 1) {
//					scores[0]--;
//					scores[1]++;
//					scores[2] += 1;
//				} else if (r == 2) {
//					scores[2] += r;	
//				}
//			} else {
//				scores[1] += r / 2;
//				scores[2] += r - (r / 2);
//			}
//		}
		
		return scores;
	}
	
	public int[] makeSurprise(int[] scores) {
		int[] newScores = scores.clone();
		
		if (scores[0] >= 1 && scores[2] <= 9) {
			if (scores[2] == scores[0]) {
				newScores[0]--;
				newScores[2]++;				
			} else if (scores[2] == scores[1]) {
				newScores[1]--;
				newScores[2]++;
			}
		}
		
		return newScores;
	}
	
	public boolean checkIfSurprisingScore(int[] scores) {
		return scores[scores.length - 1] - scores[0] >= 2;
	}
	
	public void solve(String inputFileName, String outputFileName) {
		try {
			BufferedReader reader = new BufferedReader(new FileReader(new File(inputFileName)));
			BufferedWriter writer = new BufferedWriter(new FileWriter(outputFileName));
			
			int testCount = Integer.parseInt(reader.readLine());
			for (int i = 0; i < testCount; i++) {
				String testCase = reader.readLine();
				String[] fields = testCase.split(" ");
				int manCount = Integer.parseInt(fields[0]);
				int surpriseCount = Integer.parseInt(fields[1]);
				int bestScore = Integer.parseInt(fields[2]);
				int bestScoreCount = 0;
				
				for (int j = 0; j < manCount; j++) {
					int totalScore = Integer.parseInt(fields[j + 3]);
					int[] scores = this.deriveScores(totalScore);
					
					if (scores[2] < bestScore) {
						if (surpriseCount > 0) {
							int[] tempScores = this.makeSurprise(scores);
							if (tempScores[2] >= bestScore) {
								scores = tempScores;
								surpriseCount--;
							}	
						}
					}
					
					if (scores[2] >= bestScore) {
						bestScoreCount++;
//						System.out.println(totalScore + ", best");
					} else {
//						System.out.println(totalScore);
					}
				}
				
				writer.write("Case #" + (i + 1) + ": " + bestScoreCount);
				writer.newLine();
			}
			
			reader.close();
			writer.close();
		} catch (Exception e) {
			throw new RuntimeException(e.getMessage(), e);
		}
	}
	
	public static void main(String[] args) {
		ProblemB problem = new ProblemB();
//		problem.solve("B-small-attempt.in", "B-small-attempt.out");
//		problem.solve("B-small-attempt0.in", "B-small-attempt0.out");
		problem.solve("B-large.in", "B-large.out");
//		problem.solve("B-small-attempt.in", "B-small-attempt.out");
//		problem.solve("B-small-attempt.in", "B-small-attempt.out");
	}
}
