package com.silverduner.codejam;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.HashMap;

public class Dancing {
	public static void main(String[] args) throws Exception {
		File input = new File("B-small-attempt0.in");
		BufferedReader in = new BufferedReader(new FileReader(input));

		File output = new File("1.out");
		BufferedWriter out = new BufferedWriter(new FileWriter(output));

		// parse input
		int N = Integer.parseInt(in.readLine());
		for(int i=0;i<N;i++) {
			String str = in.readLine();
			out.write("Case #"+(i+1)+": ");
			System.out.println("-------");
			String[] words = str.split(" ");
			int n = Integer.parseInt(words[0]);
			int suprise = Integer.parseInt(words[1]);
			int threshold = Integer.parseInt(words[2]);
			int[] scores = new int[n];
			for(int j=0;j<n;j++) {
				scores[j] = Integer.parseInt(words[3+j]);
			}
			int count = 0;
			for(int score : scores) {
				int a,b,c;
				boolean find = false;
				boolean sfind = false;
				for(a = 10; a>=0 && !find; a--) {
					if(3*a-4>score)
						continue;
					for(b = a; b>=0 && b >=a-2 && !find; b--) {
						for(c = b; c>=0 && c >=b-2 && c >=a-2 && !find; c--) {
							System.out.println(a+","+b+","+c);
							if(a+b+c==score) {
								if(a >= threshold) {
									if(a-c <= 1){
										count++;
										find = true;
										System.out.println("find!");
									}
									else if(a-c == 2){
										sfind = true;
										System.out.println("suprise!");
									}
								}
							}
							
						}
					}
				}
				if(!find && sfind && suprise > 0)
				{
					count++;
					suprise --;
				}
			}
			int maxCount = count;
			out.write(maxCount+"\n");
		}
		out.flush();
		out.close();
		in.close();
	}
}

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

import java.util.Scanner;

/**
 *
 * @author leonardo
 */
public class Dance {
    
    static boolean canBeSurprising(int x1, int x2, int x3) {                
        if (x1 > 10 || x2 > 10 || x3 > 10)
            return false ;
        
        return (Math.abs(x1 -x2) >= 2) || (Math.abs(x1 -x3) >= 2) || (Math.abs(x2 -x3) >= 2) ;
    }
    
    /*static boolean canBeSurprising(int r, int x, int p) {                
        boolean[] res = new boolean[2] ;
        
        if (r == 0) {
            return canBeSurprising(x, x, x) || canBeSurprising(x-1, x+1, x) ;           
        }        
        else if (r == 1) {
            return canBeSurprising(x+1, x, x, p, res) || canBeSurprising(x+1, x+1, x-1) ;
        }
        else {
            canBeSurprising(x+2, x, x, p, res);
            canBeSurprising(x, x+1, x+1, p, res) ;        
        }
        return (! res[0] && res[1]) ? 1 : 0;
    }*/

    public static void main(String[] args) {               
        Scanner scanner = new Scanner(System.in) ;
        int inputSize = Integer.parseInt(scanner.nextLine()) ;
                
        for(int i = 1; i <= inputSize; i++) {
            String[] numbers = scanner.nextLine().split(" ") ;
                    
            int n = Integer.parseInt(numbers[0]) ;
            int s = Integer.parseInt(numbers[1]) ;
            int p = Integer.parseInt(numbers[2]) ;
            
            int count = 0 ;
            for(int googler = 0; googler < n; googler++) {
                int score = Integer.parseInt(numbers[googler + 3]) ;
                
                int r = score % 3 ;
                int x = score / 3 ;
                
                if (r == 0) {
                    
                    // possible maxs: x and x + 1
                    
                    if (x >= p)
                        count++ ;
                    else if ((score > 0) && s > 0 && (x + 1) >= p) {
                        s-- ;
                        count++ ;
                    }
                        
                }
                
                // r == 1 -> max = x + 1
                else if (r == 1 && (x + 1 >= p))
                    count++ ;
                
                else {
                                        
                   // possible maxs: x + 1 and x + 2 
                    
                   if ((x + 1) >= p)
                        count++ ;
                   else if ((x+2 <= 10) && (x+2 >= p) && (s > 0)) {
                        count++ ;
                        s-- ;
                    }
                }
            }
            System.out.println("Case #" + i + ": " + count) ;
        }                
    }
}

