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

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.StringTokenizer;

/**
 *
 * @author devashish
 */
public class ProblemB {

    public static void main(String[] args) {
        StringTokenizer st = null;
        BufferedReader in;
        PrintWriter out = null;
        try {
            in = new BufferedReader(new FileReader(new File("E:/b.in")));
            out = new PrintWriter(new FileWriter(new File("E:/b.out")));

            while (st == null || !st.hasMoreTokens()) {
                st = new StringTokenizer(in.readLine());
            }
            int t = Integer.parseInt(st.nextToken());
            for (int i = 1; i <= t; i++) {
                while (st == null || !st.hasMoreTokens()) {
                    st = new StringTokenizer(in.readLine());
                }

                int N = Integer.parseInt(st.nextToken());
                int S = Integer.parseInt(st.nextToken());
                int p = Integer.parseInt(st.nextToken());
                int[] T = new int[N];
                for (int j = 0; j < N; j++) {
                    T[j] = Integer.parseInt(st.nextToken());
                }

                int outputLine = maxGooglers(N, S, p, T);

                out.print("Case #" + i + ": " + outputLine + "\n");
            }
        } catch (IOException e) {
        }
        out.flush();
    }

    private static int maxGooglers(int N, int S, int p, int[] T) {
        int output = 0;

        int surprisingMinScore = Math.max(3 * p - 4, 0) ;
        int nonSurprisingMinScore = Math.max(3 * p - 2, 0);
        int countSurprise = 0;
        
       // System.out.println(surprisingMinScore);
       // System.out.println(nonSurprisingMinScore);

        for (int i = 0; i < T.length; i++) {
            //    System.out.println(T[i]);            
         //   System.out.println("T[i]: " + T[i]);
            if (T[i] < surprisingMinScore) {
                continue;
            } else if (T[i] >= surprisingMinScore && T[i] < nonSurprisingMinScore) {
                //either surprising or low scores
                //countSurprise += findPossibleSurprisingScoresWithBestResult(T[i], p);
                if (S > 0 && T[i] >= 2) {
                    countSurprise += findPossibleSurprisingScoresWithBestResult(T[i], p);
           //         System.out.println("#countSurprise: " + countSurprise);
                    //output += findPossibleSurprisingScoresWithBestResult(T[i], p);
                }                
            } else if (T[i] >= nonSurprisingMinScore) {
                //Non surprising score
                //System.out.println("non surprising score.");
                output++;
            }          
        }
        
        //System.out.println("#output: " + output);
        //System.out.println((countSurprise < S ? countSurprise : S));
        return output + (countSurprise < S ? countSurprise : S);
    }
    
    private static int findPossibleSurprisingScoresWithBestResult(int t, int p) {
        int count = 0;
        int a = t/3;
        int b = ((t + 4)/3);

        if (p >= a && p <=b) {
            count++;
        }
        //System.out.println("#count:" + count);
        return count;
    }
}
