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.
 */
package gcj2012;

/**
 *
 * @author allegea
 */
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.StringTokenizer;

/**
 *
 * @author Allegea
 */
public class DancingWiththeGooglers {
 
    public static void main(String[] args) throws IOException,FileNotFoundException{
        
        
        
        String name = "B-small-attempt0";
        
        BufferedReader in   = new BufferedReader(new FileReader(name+".in"));
        
        // BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        FileWriter archivo = new FileWriter(name+".out");
        PrintWriter out = new PrintWriter(archivo);
        out.flush();

       
         
           String line;
           StringBuilder buil = new StringBuilder();
           line = in.readLine();
           int cases = Integer.parseInt(line);
           int act = 0;
            while (act++<cases) 
            {
                
                StringTokenizer x = new StringTokenizer(in.readLine());
                int n= Integer.parseInt(x.nextToken());
                int p = Integer.parseInt(x.nextToken());
                int max = Integer.parseInt(x.nextToken());
                int[] s = new int[n];
                for(int i=0;i<n;i++)
                    s[i] = Integer.parseInt(x.nextToken());
                

                int count=0;
                int sup = 0;
                for(int i=0;i<n;i++){
                    int avg = s[i]/3;
                    int res = s[i]-avg*3;
                    //System.out.println(avg+" - "+res+" - "+s[i]);
                    
                    if(avg==0){
                        if(s[i]>=max)count++;
                        continue;
                    }
                    if(avg>=max)
                    {
                        count++;
                        continue;
                    }
                    
                    if(res==0)
                    {
                        if(avg+1==max)sup++;
                    }else if (res ==1){
                        if(avg+1==max)count++;
                    }else{
                        if(avg+1==max)count++;
                        else if(avg+2==max)sup++;
                    }

                }
                //System.out.println(sup+" - "+count);
                count+=Math.min(p, sup);
                
                
                
                System.out.println("Case #"+act+": "+count);
               out.println("Case #"+act+": "+count);
              // System.out.println(line); 
                
            }


        in.close();
        out.close();
        System.exit(0);

        

        
        
    }
   


}

