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 problemB;

import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.Writer;
import java.util.Scanner;

public class DancingWithTheGooglers {
	
	public static void main(String[] args) throws Exception {
		
		Writer write = new FileWriter(new File("out.txt"));
		Writer writer = new BufferedWriter(write);
		
		Scanner scan = new Scanner(new File("B-large.in.txt"));
		
		int t = scan.nextInt();
		
		for(int i = 1; i<=t; i++) {
			int n = scan.nextInt();
			int s = scan.nextInt();
			int p = scan.nextInt();
			Score[] score = new Score[n];
			for(int j = 0; j<score.length; j++) {
				score[j] = new Score(scan.nextInt());
			}
			
			
			int count = 0;
			for(int j = 0; j<n; j++) {
				if(score[j].bestScore(p)) {
					count++;
					score[j] = null;
				}
			}
			
			int surprising = 0;
			for(int j = 0; j<n && surprising<s; j++) {
				if(score[j]!=null) {
					if(score[j].bestScoreOther(p)) {
						count++; surprising++;
					}
				}
			}
			writer.write("Case #"+i+": "+count+"\n");
		}
		
		writer.close();
		write.close();
		
	}
	
	
	private static class Score {
		int[] not;
		int[] surprising;
		
		public Score(int num) {
			not = new int[3];
			buildScores(num);
		}
		
		public boolean bestScore(int score) {
			for(int i : not) {
				if(i>=score) return true;
			}
			return false;
		}
		
		public boolean bestScoreOther(int score) {
			if(surprising==null) return false;
			for(int i : surprising) {
				if(i>=score) return true;
			}
			return false;
		}
		
		private void buildScores(int num) {
			int i = 0;
			while(i<num) {
				if(i<num) { not[0]++; i++; }
				
				if(i<num) {	not[1]++; i++; }
				
				if(i<num) { not[2]++; i++; }
			}
			
			buildSurprising();
		}

		private void buildSurprising() {
			int increment = -1;
			int decrement = -1;
			if(not[0]==not[1]) {
				if(not[0]!=10) increment = 0;
				if(not[1]!=0) decrement = 1;
			} else if (not[0]==not[2]) {
				if(not[0]!=10)increment = 0;
				if(not[0]!=0)decrement = 2;
			} else if (not[1]==not[2]) {
				if(not[0]!=10)increment = 1;
				if(not[0]!=0)decrement = 2;
			}
			
			if(increment!=-1 && decrement!=-1) {
				surprising = new int[]{not[0], not[1], not[2]};
				surprising[increment]++;
				surprising[decrement]--;
			}
		}
		
		
	}

}
