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 ? " *" : ""));
//    }
    
}


import java.io.*;
import java.util.*;

public class Dancing {
    public enum Category {containsHighNotSupprising, containsHighOnlyIfSupprising, doesNotContainHigh};
    
    public class Score {
        
        public Score(int p, int score) {
            this.score = score;
            this.category = getCategoryFor(p, score);
        }
        
        private Category getCategoryFor(int p, int score) {
            if (score >= 29) {
                return Category.containsHighNotSupprising;
            } else if (score == 1) {
                if (p == 0 || p == 1) {
                    return Category.containsHighNotSupprising;
                }
                return Category.doesNotContainHigh;
            } else if (score == 0) {
                if (p == 0) {
                    return Category.containsHighNotSupprising;
                }
                return Category.doesNotContainHigh;
            } else if (score >= (3*p)-2) {
                return Category.containsHighNotSupprising;
            } else if (score >= (3*p)-4) {
                return Category.containsHighOnlyIfSupprising;
            }
            return Category.doesNotContainHigh;
        }
        
        public int score;
        public Category category;
    }
    
    public class TestCase {
        int p;
        int s;
        List<Score> scores = new ArrayList<Score>();
        
        public TestCase(String line) {
            Scanner scan = new Scanner(line);
            int numScores = scan.nextInt();
            s = scan.nextInt();
            p = scan.nextInt();
            for(int i = 0; i < numScores; i++) {
                int score = scan.nextInt();
                scores.add(new Score(p,score));
            }
        }
        
        public int getResult() {
            int countContainsHighNotSurprising = 0;
            int countContainsHighOnlyIfSurprising = 0;
            for(Score score : scores) {
                if(score.category==Category.containsHighNotSupprising) countContainsHighNotSurprising++;
                else if(score.category==Category.containsHighOnlyIfSupprising) countContainsHighOnlyIfSurprising++;
            }
            return countContainsHighNotSurprising + Math.min(s,countContainsHighOnlyIfSurprising);
        }
    }
    
    
    
    public static final PrintStream out = System.out;
    public static final BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
    public int numCases;
    
    public void doCase(int caseNumber) throws Exception {
        String line = in.readLine();
        TestCase testCase = new TestCase(line);
        out.println(testCase.getResult());
    }
    
    public void run() throws Exception {
        numCases = Integer.parseInt(in.readLine().trim());
        for (int i = 1; i <= numCases; i++) {
            out.print("Case #" + i + ": ");
            doCase(i);
        }
    }
    
    public static void main(String[] args) throws Exception {
        new Dancing().run();
    }

}
