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

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.Scanner;
import java.util.StringTokenizer;

/**
 *
 * @author ahmet
 */
public class codeJam {
    
    
    public static void main(String[] args) throws FileNotFoundException, IOException
    {
        Scanner scan = new Scanner(System.in);
        
        
        int T = scan.nextInt();
        
        for(int i = 0; i < T; i++)
        {
            ArrayList<Integer> list = new ArrayList<Integer>();
            int howMany = scan.nextInt();
            int S = scan.nextInt();
            int p = scan.nextInt();
            
            for(int ii = 0; ii < howMany; ii++)
            {
                list.add(scan.nextInt());
            }
            Collections.sort(list);
            System.out.println("Case #" + (i + 1) + ": " + analiz(list, S, p));
        }  
    }
    
    public static String analiz( ArrayList <Integer> a, int S, int p)
    {
        int count = 0;
        for(int i = 0; i < a.size(); i++)
        {
            if(a.get(i)/3 >= p)
            {
                 a.set(i, -1);
                 count++;
            }
        }   
        for(int i = 0; i < a.size(); i++)
        {
            if(a.get(i) == -1)
            {
                 a.remove(i);
                 i=0;
            }
        }
        while(S >= 0 && a.size() > 0 && a.get(a.size() - 1 ) > 0)
        {
            if(a.get(a.size() - 1 )%3 == 0 )
            {
                if(a.get(a.size() - 1)/3 + 1 >= p && S != 0)
                {
                    count++;
                    S--;
                }
                else
                    break;
            }
            else if(a.get(a.size() - 1 ) % 3 == 1)
            {
                if(a.get(a.size() - 1)/3 + 1 >= p)
                {
                    count++;
                }
                else
                    break;

            }
            else if(a.get(a.size() - 1 ) % 3 == 2)
            {
                if(a.get(a.size() - 1) /3 + 1 >= p)
                {
                    count++;
                }      
                else if(a.get(a.size() - 1)/3 + 2 >= p && S != 0)
                {
                    count++;
                    S--;
                }
                else
                    break;
            }     
            a.remove(a.size() - 1 );            
        }
        
        return "" + count;
    }
    
}
