package com.example;

import java.io.IOException;
import java.util.List;

public class ProblemB {
    
    enum Result {
	INSUFFICIENT,
	SUFFICIENT,
	SUFFICIENT_WHEN_SURPRISING
    }

    public static void main(String[] a) throws IOException {

	List<String> lines = FileUtil.getLines("/B-large.in");
	
	int cases = Integer.valueOf(lines.get(0));
	
	for(int c=0; c<cases; c++) {
	    String[] tokens = lines.get(c+1).split(" ");
	    
	    int n = Integer.valueOf(tokens[0]); // N = number of Googlers
	    int s = Integer.valueOf(tokens[1]); // S = number of surprising triplets
	    int p = Integer.valueOf(tokens[2]); // P = __at least__ a score of P
	    
	    int sumSufficient = 0;
	    int sumSufficientSurprising = 0;
	    
	    for(int i=0; i<n; i++) {
		int points = Integer.valueOf(tokens[3+i]);
		
		switch(test(points, p)) {
		case SUFFICIENT:
		    sumSufficient++;
		    break;
		    
		case SUFFICIENT_WHEN_SURPRISING:
		    sumSufficientSurprising++;
		    break;
		}
		
//		uSystem.out.println("points "+ points +" ? "+ p +" => "+ result);
	    }
	    
	    System.out.println("Case #"+ (c+1) +": "+ (sumSufficient + Math.min(s, sumSufficientSurprising)));
	    
//	    System.out.println();
//	    System.out.println("N="+ n +", S="+ s +", P="+ p);
//	    System.out.println();
	}
    }

    private static Result test(int n, int p) {
	int fac = n / 3;
	int rem = n % 3;
	
	if(rem == 0) {
	    
//	    int triplet0[] = { fac, fac, fac };
//	    print(n, triplet0);
	    
	    if(fac >= p) {
		return Result.SUFFICIENT;
	    }
	    
	    if(fac > 0 && fac < 10) {
		
		if(fac+1 >= p) {
		    return Result.SUFFICIENT_WHEN_SURPRISING;
		}
		
//		int triplet1[] = { fac+1, fac, fac-1 }; // surprising 
//		print(n, triplet1);
	    }
	    
	    
	} else if(rem == 1) {
	    
//	    int triplet0[] = { fac+1, fac, fac };
//	    print(n, triplet0);
	    
	    if(fac+1 >= p) {
		return Result.SUFFICIENT;
	    }
	    
//	    if(fac > 0 && fac < 10) {
//		int triplet1[] = { fac+1, fac+1, fac-1 };
//		print(n, triplet1);
//	    }
	    
	} else if(rem == 2) {
	    
//	    int triplet0[] = { fac+1, fac+1, fac };
//	    print(n, triplet0);
	    
	    if(fac+1 >= p) {
		return Result.SUFFICIENT;
	    }
	    
	    if(fac < 9) {
//		int triplet1[] = { fac+2, fac, fac }; // surprising
//		print(n, triplet1);

		if(fac+2 >= p) {
		    return Result.SUFFICIENT_WHEN_SURPRISING;
		}
	    }
	    
	} else {
	    throw new RuntimeException("error");
	}
	
	return Result.INSUFFICIENT;
//	System.out.println();
//	System.out.println(n +" => "+ div3 +" ("+ rem +")");
    }
    
//    private static void print(int n, int[] triplet) {
//	System.out.println("n="+ n +" ("+ (n/3) +","+ (n%3) +") => ["+ triplet[0] +","+ triplet[1] +","+ triplet[2] +"]" + (triplet[0]-triplet[2] > 1 ? " *" : ""));
//    }
    
}

package com.irabin.google.codejam.problem2;

import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Scanner;

public class DanceWithGoogler {

	class Score {

		private Long score;
		private Long firstJury;
		private Long secondJury;
		private Long thirdJury;

		public Score() {
		}

		public Long getScore() {
			return score;
		}

		public void setScore(Long score) {
			this.score = score;
		}

		public Long getFirstJury() {
			return firstJury;
		}

		public void setFirstJury(Long firstJury) {
			this.firstJury = firstJury;
		}

		public Long getSecondJury() {
			return secondJury;
		}

		public void setSecondJury(Long secondJury) {
			this.secondJury = secondJury;
		}

		public Long getThirdJury() {
			return thirdJury;
		}

		public void setThirdJury(Long thirdJury) {
			this.thirdJury = thirdJury;
		}

		public boolean isSuprisedResult() {
			boolean suprise = false;
			if (Math.abs(firstJury - secondJury) >= 2
					|| Math.abs(firstJury - thirdJury) >= 2
					|| Math.abs(secondJury - thirdJury) >= 2) {
				suprise = true;
			}
			return suprise;
		}

	}

	private Scanner scanner;
	private PrintWriter writer;

	public DanceWithGoogler(InputStream in, OutputStream os) {
		scanner = new Scanner(in);
		writer = new PrintWriter(os);
	}

	public void solve() {

		int n = Integer.parseInt(scanner.nextLine());

		for (int i = 1; i <= n; i++) {
			writer.print("Case #" + i + ": ");

			int N = scanner.nextInt();
			int S = scanner.nextInt();
			int p = scanner.nextInt();

			String output = "";
			int totalBetterThanP = 0;
			int foundSuprise = 0;

			Score[] scores = new Score[N];
			for (int j = 0; j < N; j++) {
				scores[j] = new Score();
				scores[j].setScore(scanner.nextLong());
			}

			// sort ascending
			for (int j = 0; j < N; j++) {
				for (int k = j + 1; k < N; k++) {
					if (scores[k].getScore() > scores[j].getScore()) {
						Score tempScore = scores[k];
						scores[k] = scores[j];
						scores[j] = tempScore;
					}
				}
			}

			for (int j = 1; j <= N; j++) {

				Long equalScore = scores[j - 1].getScore() / 3;

				Long firstJury = equalScore;
				Long secondJury = equalScore;
				Long thirdJury = equalScore;

				Long dividen = scores[j - 1].getScore() % 3;
				while (dividen > 0) {
					firstJury = firstJury + 1;
					dividen = dividen - 1;
					if (dividen > 0) {
						secondJury = secondJury + 1;
						dividen = dividen - 1;
					}
					if (dividen > 0) {
						thirdJury = thirdJury + 1;
						dividen = dividen - 1;
					}
				}

				scores[j - 1].setFirstJury(firstJury);
				scores[j - 1].setSecondJury(secondJury);
				scores[j - 1].setThirdJury(thirdJury);
			}

			for (int j = 1; j <= N; j++) {

				if (scores[j - 1].isSuprisedResult()) {
					foundSuprise = foundSuprise + 1;
				} else {
					if (foundSuprise < S && ((scores[j-1].getFirstJury()<p && scores[j-1].getSecondJury()<p && scores[j-1].getThirdJury()<p)||(j<N && scores[j].getScore()<5))) {
						scores[j - 1].setFirstJury(scores[j-1].getFirstJury() - 1);
						if (scores[j - 1].getSecondJury() < p) {
							scores[j - 1].setSecondJury(scores[j - 1].getSecondJury() + 1);
						} else if (scores[j - 1].getThirdJury() < p) {
							scores[j - 1].setThirdJury(scores[j - 1].getThirdJury() + 1);
						} else {
							scores[j - 1].setSecondJury(scores[j - 1].getSecondJury() + 1);
						}
						foundSuprise = foundSuprise + 1;
					}
				}

				if (scores[j-1].getFirstJury() >= p || scores[j-1].getSecondJury() >= p || scores[j-1].getThirdJury() >= p) {
					totalBetterThanP = totalBetterThanP + 1;
				}

			}
			output = String.valueOf(totalBetterThanP);

			writer.println(output);
			writer.flush();
		}
		writer.close();

	}

	public static void main(String args[]) {

		InputStream input = null;
		input = DanceWithGoogler.class.getResourceAsStream(args[0]);

		OutputStream output = null;
		try {
			output = new FileOutputStream(args[1]);
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		}

		DanceWithGoogler practise1 = new DanceWithGoogler(input, output);
		practise1.solve();
	}
}
