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

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package dancing;

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;

public class Dancing {
    
    
    public static int numDancer(double[] a, double numtoget, int s)
    {
        int iter = 0;
        for(int i = 0; i < a.length; i++)
        {
            a[i] = a[i] - numtoget;
            double c = Math.floor(a[i]/2);
            if(a[i] < 0)
            {
                
            }
            else if(c > numtoget || c == numtoget || c == numtoget - 1)
            {
                iter = iter + 1;
            }
            else if (c == numtoget - 2 && s != 0)
            {
                s = s - 1;
                iter = iter + 1;
            }
        }
        return iter;
    }

    
    
    public static void main(String[] args) throws FileNotFoundException, IOException  {
        
     FileReader theFileID = new FileReader("B-large.in");
     BufferedReader inFile = new BufferedReader(theFileID);
     FileWriter fw = new FileWriter("output.txt");
     PrintWriter output = new PrintWriter(fw);
     String line;

     int numCases = 0;
     if((line = inFile.readLine()) != null)
         numCases = Integer.parseInt(line);

     String[] x = null;
     int n = 0, s = 0;
     double numtoget = 0;
     
     
  
     for(int i = 0; (line = inFile.readLine()) != null && i < numCases; i++) {
         
         x = line.split(" ");
         n = Integer.parseInt(x[0]);
         s = Integer.parseInt(x[1]);
         numtoget = Integer.parseInt(x[2]);
         double[] a = new double[n];
         for(int j = 3; j < x.length; j++)
         {
             a[j-3] = Integer.parseInt(x[j]);
         }
         
         int y = numDancer(a, numtoget, s);
         
         output.write("Case #"+ (i + 1) + ": " + y);
            output.println();
         
         
            }

            
            
     
     inFile.close();
     output.close();
     fw.close();
        
     double[] b = {15, 13, 11};
        System.out.println(numDancer(b, 5, 1));
        double[] c = {23, 22, 21};
        System.out.println(numDancer(c, 8, 0));
        double[] e = {8, 0};
        System.out.println(numDancer(e, 1, 1));
        double[] d = {29, 20, 8, 18, 18, 21};
        System.out.println(numDancer(d, 8, 2));
    }
}
